Search a number
-
+
20011020101100 = 223252729971129169
BaseRepresentation
bin1001000110011001011011…
…01111101010010111101100
32121212000221101201122102100
410203030231233222113230
510110330032121213400
6110320534041055100
74133514506234340
oct443145557522754
977760841648370
1020011020101100
116415698185106
1222b232a187490
13b22053428812
144d2777a81620
1524a7ec596100
hex12332dbea5ec

20011020101100 has 432 divisors, whose sum is σ = 74920339166400. Its totient is φ = 4370693160960.

The previous prime is 20011020101099. The next prime is 20011020101131. The reversal of 20011020101100 is 110102011002.

It is a happy number.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is an unprimeable number.

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 17157316 + ... + 18286484.

Almost surely, 220011020101100 is an apocalyptic number.

20011020101100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 20011020101100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37460169583200).

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

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

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

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

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

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

Adding to 20011020101100 its reverse (110102011002), we get a palindrome (20121122112102).

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