Base | Representation |
---|---|
bin | 1001000110001001000001… |
… | …01111110011110000000000 |
3 | 2121211012012112220212220212 |
4 | 10203010200233303300000 |
5 | 10110204012244213440 |
6 | 110312520035053252 |
7 | 4133053314411164 |
oct | 443044057636000 |
9 | 77735175825825 |
10 | 20002212101120 |
11 | 6411988302387 |
12 | 22b0690441228 |
13 | b2127b691402 |
14 | 4d217dd68ca4 |
15 | 24a484193465 |
hex | 123120bf3c00 |
20002212101120 has 44 divisors (see below), whose sum is σ = 47981868962664. Its totient is φ = 8000884838400.
The previous prime is 20002212101101. The next prime is 20002212101141. The reversal of 20002212101120 is 2110121220002.
It is a junction number, because it is equal to n+sod(n) for n = 20002212101095 and 20002212101104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1953335906 + ... + 1953346145.
Almost surely, 220002212101120 is an apocalyptic number.
20002212101120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20002212101120 is an abundant number, since it is smaller than the sum of its proper divisors (27979656861544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002212101120 is an equidigital number, since it uses as much as digits as its factorization.
20002212101120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3906682076 (or 3906682058 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20002212101120 its reverse (2110121220002), we get a palindrome (22112333321122).
The spelling of 20002212101120 in words is "twenty trillion, two billion, two hundred twelve million, one hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •