Base | Representation |
---|---|
bin | 1001000110000110110010… |
… | …01010110011111010000110 |
3 | 2121211002002212020210212010 |
4 | 10203003121022303322012 |
5 | 10110144032333020402 |
6 | 110312200540035050 |
7 | 4133011463163303 |
oct | 443033112637206 |
9 | 77732085223763 |
10 | 20001011220102 |
11 | 6411421454730 |
12 | 22b03b6232a86 |
13 | b2111994bc23 |
14 | 4d20a868a0aa |
15 | 24a413a31a6c |
hex | 1230d92b3e86 |
20001011220102 has 128 divisors (see below), whose sum is σ = 46202766704640. Its totient is φ = 5708557088640.
The previous prime is 20001011220053. The next prime is 20001011220133. The reversal of 20001011220102 is 20102211010002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 211641753 + ... + 211736235.
It is an arithmetic number, because the mean of its divisors is an integer number (360959114880).
Almost surely, 220001011220102 is an apocalyptic number.
20001011220102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 20001011220102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23101383352320).
20001011220102 is an abundant number, since it is smaller than the sum of its proper divisors (26201755484538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001011220102 is a wasteful number, since it uses less digits than its factorization.
20001011220102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95498.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20001011220102 its reverse (20102211010002), we get a palindrome (40103222230104).
The spelling of 20001011220102 in words is "twenty trillion, one billion, eleven million, two hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •