Search a number
-
+
110221210113 = 3744911689597
BaseRepresentation
bin110011010100110110…
…0100011001000000001
3101112111111122121121020
41212221230203020001
53301213112210423
6122345051020053
710651245553620
oct1465154431001
9345444577536
10110221210113
1142820aaa593
1219440a3a629
13a51729c371
1454987276b7
152d017414e3
hex19a9b23201

110221210113 has 16 divisors (see below), whose sum is σ = 168330211200. Its totient is φ = 62843268096.

The previous prime is 110221210111. The next prime is 110221210153. The reversal of 110221210113 is 311012122011.

It is not a de Polignac number, because 110221210113 - 21 = 110221210111 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 110221210092 and 110221210101.

It is not an unprimeable number, because it can be changed into a prime (110221210111) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5835370 + ... + 5854227.

It is an arithmetic number, because the mean of its divisors is an integer number (10520638200).

Almost surely, 2110221210113 is an apocalyptic number.

It is an amenable number.

110221210113 is a deficient number, since it is larger than the sum of its proper divisors (58109001087).

110221210113 is a wasteful number, since it uses less digits than its factorization.

110221210113 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 11690056.

The product of its (nonzero) digits is 24, while the sum is 15.

Adding to 110221210113 its reverse (311012122011), we get a palindrome (421233332124).

The spelling of 110221210113 in words is "one hundred ten billion, two hundred twenty-one million, two hundred ten thousand, one hundred thirteen".

Divisors: 1 3 7 21 449 1347 3143 9429 11689597 35068791 81827179 245481537 5248629053 15745887159 36740403371 110221210113