Base | Representation |
---|---|
bin | 110010000001011100111011… |
… | …001001010110111100001100 |
3 | 1001211221222212202120220210121 |
4 | 302001130323021112330030 |
5 | 212314003301120041022 |
6 | 2055523323115114324 |
7 | 64224425116111033 |
oct | 6201347311267414 |
9 | 1054858782526717 |
10 | 220002102112012 |
11 | 64110405221240 |
12 | 20811a6aa429a4 |
13 | 959b155c1cb7c |
14 | 3c4823111b71a |
15 | 1a67b5d7582c7 |
hex | c8173b256f0c |
220002102112012 has 48 divisors (see below), whose sum is σ = 445414902912000. Its totient is φ = 93969388396800.
The previous prime is 220002102111991. The next prime is 220002102112027. The reversal of 220002102112012 is 210211201200022.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 232587012 + ... + 233530987.
It is an arithmetic number, because the mean of its divisors is an integer number (9279477144000).
Almost surely, 2220002102112012 is an apocalyptic number.
220002102112012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
220002102112012 is an abundant number, since it is smaller than the sum of its proper divisors (225412800799988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220002102112012 is a wasteful number, since it uses less digits than its factorization.
220002102112012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466118662 (or 466118660 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 220002102112012 its reverse (210211201200022), we get a palindrome (430213303312034).
The spelling of 220002102112012 in words is "two hundred twenty trillion, two billion, one hundred two million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •