Base | Representation |
---|---|
bin | 1001000110001001000001… |
… | …01000101001000000011110 |
3 | 2121211012012102101102101220 |
4 | 10203010200220221000132 |
5 | 10110204011304101420 |
6 | 110312515530514210 |
7 | 4133053262424054 |
oct | 443044050510036 |
9 | 77735172342356 |
10 | 20002210222110 |
11 | 6411987239686 |
12 | 22b068b895966 |
13 | b2127b18407c |
14 | 4d217d9da1d4 |
15 | 24a483e21840 |
hex | 123120a2901e |
20002210222110 has 64 divisors (see below), whose sum is σ = 50488841410560. Its totient is φ = 5064467091840.
The previous prime is 20002210222109. The next prime is 20002210222123. The reversal of 20002210222110 is 1122201220002.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20002210222110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 202854040 + ... + 202952619.
It is an arithmetic number, because the mean of its divisors is an integer number (788888147040).
Almost surely, 220002210222110 is an apocalyptic number.
20002210222110 is an abundant number, since it is smaller than the sum of its proper divisors (30486631188450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002210222110 is a wasteful number, since it uses less digits than its factorization.
20002210222110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405806753.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20002210222110 its reverse (1122201220002), we get a palindrome (21124411442112).
The spelling of 20002210222110 in words is "twenty trillion, two billion, two hundred ten million, two hundred twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •