Base | Representation |
---|---|
bin | 1001000110011011101010… |
… | …10100110001100011110011 |
3 | 2121212011001002110020202122 |
4 | 10203031311110301203303 |
5 | 10110340012034342321 |
6 | 110321253140504455 |
7 | 4133556330636041 |
oct | 443156524614363 |
9 | 77764032406678 |
10 | 20012221012211 |
11 | 641615405342a |
12 | 22b26043ab12b |
13 | b221b517b8cc |
14 | 4d284d36b391 |
15 | 24a86cc118ab |
hex | 1233755318f3 |
20012221012211 has 2 divisors, whose sum is σ = 20012221012212. Its totient is φ = 20012221012210.
The previous prime is 20012221012177. The next prime is 20012221012243. The reversal of 20012221012211 is 11221012221002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20012221012211 - 222 = 20012216817907 is a prime.
It is a super-2 number, since 2×200122210122112 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20012221012211.
It is not a weakly prime, because it can be changed into another prime (20012221012271) 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 as a sum of consecutive naturals, namely, 10006110506105 + 10006110506106.
It is an arithmetic number, because the mean of its divisors is an integer number (10006110506106).
Almost surely, 220012221012211 is an apocalyptic number.
20012221012211 is a deficient number, since it is larger than the sum of its proper divisors (1).
20012221012211 is an equidigital number, since it uses as much as digits as its factorization.
20012221012211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20012221012211 its reverse (11221012221002), we get a palindrome (31233233233213).
The spelling of 20012221012211 in words is "twenty trillion, twelve billion, two hundred twenty-one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •