Base | Representation |
---|---|
bin | 110010010011000011110000… |
… | …000000001101111010010111 |
3 | 1002000020122220011200210222121 |
4 | 302103003300000031322113 |
5 | 212443314210140431012 |
6 | 2102251222225440411 |
7 | 64411020062146204 |
oct | 6223036000157227 |
9 | 1060218804623877 |
10 | 221212022202007 |
11 | 64537545602811 |
12 | 209884567a0107 |
13 | 96582867968c5 |
14 | 3c8aa0cd26cab |
15 | 1a893742b9a07 |
hex | c930f000de97 |
221212022202007 has 2 divisors, whose sum is σ = 221212022202008. Its totient is φ = 221212022202006.
The previous prime is 221212022202001. The next prime is 221212022202013. The reversal of 221212022202007 is 700202220212122.
It is a balanced prime because it is at equal distance from previous prime (221212022202001) and next prime (221212022202013).
It is a cyclic number.
It is not a de Polignac number, because 221212022202007 - 23 = 221212022201999 is a prime.
It is a super-2 number, since 2×2212120222020072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221212022202001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110606011101003 + 110606011101004.
It is an arithmetic number, because the mean of its divisors is an integer number (110606011101004).
Almost surely, 2221212022202007 is an apocalyptic number.
221212022202007 is a deficient number, since it is larger than the sum of its proper divisors (1).
221212022202007 is an equidigital number, since it uses as much as digits as its factorization.
221212022202007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 25.
Adding to 221212022202007 its reverse (700202220212122), we get a palindrome (921414242414129).
The spelling of 221212022202007 in words is "two hundred twenty-one trillion, two hundred twelve billion, twenty-two million, two hundred two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •