Search a number
-
+
20110100211110 = 25731310310194297
BaseRepresentation
bin1001001001010001111110…
…11000010010010110100110
32122012111200110102201211102
410210220333120102112212
510113440441123223420
6110434241423440102
74143623013254000
oct444507730222646
978174613381742
1020110100211110
116453711333248
12230957ba56032
13b2b4b3499550
144d7496889370
1524d19ab75a75
hex124a3f6125a6

20110100211110 has 256 divisors, whose sum is σ = 45957929472000. Its totient is φ = 6295073283072.

The previous prime is 20110100211107. The next prime is 20110100211121. The reversal of 20110100211110 is 1111200101102.

It is a super-2 number, since 2×201101002111102 (a number of 27 digits) contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4680030482 + ... + 4680034778.

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

Almost surely, 220110100211110 is an apocalyptic number.

20110100211110 is an abundant number, since it is smaller than the sum of its proper divisors (25847829260890).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 5460 (or 5446 counting only the distinct ones).

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 20110100211110 its reverse (1111200101102), we get a palindrome (21221300312212).

The spelling of 20110100211110 in words is "twenty trillion, one hundred ten billion, one hundred million, two hundred eleven thousand, one hundred ten".