Base | Representation |
---|---|
bin | 1001001001010101111011… |
… | …10111000101000001101000 |
3 | 2122012201011100100120002101 |
4 | 10210222331313011001220 |
5 | 10114004312341242300 |
6 | 110435232145343144 |
7 | 4144026421053046 |
oct | 444527567050150 |
9 | 78181140316071 |
10 | 20112222212200 |
11 | 6454600129058 |
12 | 2309a72637ab4 |
13 | b2b760cbb5b1 |
14 | 4d7618621396 |
15 | 24d2720d6b6a |
hex | 124abddc5068 |
20112222212200 has 48 divisors (see below), whose sum is σ = 46954945455660. Its totient is φ = 8011507584000.
The previous prime is 20112222212191. The next prime is 20112222212213. The reversal of 20112222212200 is 221222221102.
It can be written as a sum of positive squares in 6 ways, for example, as 16052859586404 + 4059362625796 = 4006602^2 + 2014786^2 .
It is a super-2 number, since 2×201122222122002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 208584811 + ... + 208681210.
Almost surely, 220112222212200 is an apocalyptic number.
20112222212200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20112222212200 is an abundant number, since it is smaller than the sum of its proper divisors (26842723243460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112222212200 is a wasteful number, since it uses less digits than its factorization.
20112222212200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417266278 (or 417266269 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 20112222212200 its reverse (221222221102), we get a palindrome (20333444433302).
The spelling of 20112222212200 in words is "twenty trillion, one hundred twelve billion, two hundred twenty-two million, two hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •