Base | Representation |
---|---|
bin | 1001000110011011101000… |
… | …01101000101111000110111 |
3 | 2121212010222210002120012222 |
4 | 10203031310031011320313 |
5 | 10110334442232033421 |
6 | 110321251230032555 |
7 | 4133556012133352 |
oct | 443156415057067 |
9 | 77763883076188 |
10 | 20012202221111 |
11 | 64161444893a1 |
12 | 22b25ba04875b |
13 | b221b12cc809 |
14 | 4d284aa79299 |
15 | 24a86b24dcab |
hex | 123374345e37 |
20012202221111 has 16 divisors (see below), whose sum is σ = 20712233334240. Its totient is φ = 19312836816000.
The previous prime is 20012202221083. The next prime is 20012202221117. The reversal of 20012202221111 is 11112220221002.
It is a cyclic number.
It is not a de Polignac number, because 20012202221111 - 226 = 20012135112247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20012202221111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20012202221117) by changing a digit.
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, 860691236 + ... + 860714486.
It is an arithmetic number, because the mean of its divisors is an integer number (1294514583390).
Almost surely, 220012202221111 is an apocalyptic number.
20012202221111 is a deficient number, since it is larger than the sum of its proper divisors (700031113129).
20012202221111 is a wasteful number, since it uses less digits than its factorization.
20012202221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36274.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20012202221111 its reverse (11112220221002), we get a palindrome (31124422442113).
The spelling of 20012202221111 in words is "twenty trillion, twelve billion, two hundred two million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.319 sec. • engine limits •