Base | Representation |
---|---|
bin | 1001000110010111101110… |
… | …00010001110110100010100 |
3 | 2121211221120102120120010211 |
4 | 10203023313002032310110 |
5 | 10110321142132101400 |
6 | 110320303011455204 |
7 | 4133452662342304 |
oct | 443136702166424 |
9 | 77757512516124 |
10 | 20010102222100 |
11 | 6415267051021 |
12 | 22b21128b7504 |
13 | b21c38212253 |
14 | 4d26cbbcd604 |
15 | 24a796bd6dba |
hex | 1232f708ed14 |
20010102222100 has 72 divisors (see below), whose sum is σ = 45154409932800. Its totient is φ = 7687578326400.
The previous prime is 20010102222091. The next prime is 20010102222139. The reversal of 20010102222100 is 122220101002.
It is a happy number.
It is a super-3 number, since 3×200101022221003 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17509020 + ... + 18616819.
It is an arithmetic number, because the mean of its divisors is an integer number (627144582400).
Almost surely, 220010102222100 is an apocalyptic number.
20010102222100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20010102222100 is an abundant number, since it is smaller than the sum of its proper divisors (25144307710700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20010102222100 is a wasteful number, since it uses less digits than its factorization.
20010102222100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36126073 (or 36126066 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20010102222100 its reverse (122220101002), we get a palindrome (20132322323102).
The spelling of 20010102222100 in words is "twenty trillion, ten billion, one hundred two million, two hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •