Base | Representation |
---|---|
bin | 100000010011101001100… |
… | …001111000111111001101 |
3 | 21212020112001112100000012 |
4 | 200103221201320333031 |
5 | 242333302000201422 |
6 | 4415524244043005 |
7 | 316253445661625 |
oct | 40235141707715 |
9 | 7766461470005 |
10 | 2220121100237 |
11 | 786603534447 |
12 | 2ba336093465 |
13 | 13148337bb01 |
14 | 79650d7b885 |
15 | 3cb3cb3e4e2 |
hex | 204e9878fcd |
2220121100237 has 2 divisors, whose sum is σ = 2220121100238. Its totient is φ = 2220121100236.
The previous prime is 2220121100209. The next prime is 2220121100299. The reversal of 2220121100237 is 7320011210222.
2220121100237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1124605104676 + 1095515995561 = 1060474^2 + 1046669^2 .
It is a cyclic number.
It is not a de Polignac number, because 2220121100237 - 210 = 2220121099213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2220121103237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110060550118 + 1110060550119.
It is an arithmetic number, because the mean of its divisors is an integer number (1110060550119).
Almost surely, 22220121100237 is an apocalyptic number.
It is an amenable number.
2220121100237 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220121100237 is an equidigital number, since it uses as much as digits as its factorization.
2220121100237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 2220121100237 its reverse (7320011210222), we get a palindrome (9540132310459).
The spelling of 2220121100237 in words is "two trillion, two hundred twenty billion, one hundred twenty-one million, one hundred thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •