Base | Representation |
---|---|
bin | 100000000001000111011… |
… | …101010011100100010011 |
3 | 21210100011021002102002222 |
4 | 200001013131103210103 |
5 | 242022023330321321 |
6 | 4402433523531255 |
7 | 314650361305613 |
oct | 40010735234423 |
9 | 7710137072088 |
10 | 2200222120211 |
11 | 779122033205 |
12 | 2b6501b29b2b |
13 | 12c6318b400b |
14 | 786c4270a43 |
15 | 3c375bca3ab |
hex | 20047753913 |
2200222120211 has 2 divisors, whose sum is σ = 2200222120212. Its totient is φ = 2200222120210.
The previous prime is 2200222120181. The next prime is 2200222120289. The reversal of 2200222120211 is 1120212220022.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2200222120211 is a prime.
It is a super-3 number, since 3×22002221202113 (a number of 38 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2200222120211.
It is not a weakly prime, because it can be changed into another prime (2200222126211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100111060105 + 1100111060106.
It is an arithmetic number, because the mean of its divisors is an integer number (1100111060106).
Almost surely, 22200222120211 is an apocalyptic number.
2200222120211 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200222120211 is an equidigital number, since it uses as much as digits as its factorization.
2200222120211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 2200222120211 its reverse (1120212220022), we get a palindrome (3320434340233).
The spelling of 2200222120211 in words is "two trillion, two hundred billion, two hundred twenty-two million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •