Base | Representation |
---|---|
bin | 11110111000010111001… |
… | …000101100111001000101 |
3 | 21111212111221022012001121 |
4 | 132320113020230321011 |
5 | 234232031103014341 |
6 | 4302514042353541 |
7 | 306213444250636 |
oct | 36702710547105 |
9 | 7455457265047 |
10 | 2122102001221 |
11 | 748a842905a4 |
12 | 2a333b7bb8b1 |
13 | 12516208a437 |
14 | 749d304388d |
15 | 3a3027934d1 |
hex | 1ee1722ce45 |
2122102001221 has 2 divisors, whose sum is σ = 2122102001222. Its totient is φ = 2122102001220.
The previous prime is 2122102001207. The next prime is 2122102001287. The reversal of 2122102001221 is 1221002012212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1326848268321 + 795253732900 = 1151889^2 + 891770^2 .
It is a cyclic number.
It is not a de Polignac number, because 2122102001221 - 213 = 2122101993029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2122102001195 and 2122102001204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2122102001521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1061051000610 + 1061051000611.
It is an arithmetic number, because the mean of its divisors is an integer number (1061051000611).
Almost surely, 22122102001221 is an apocalyptic number.
It is an amenable number.
2122102001221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2122102001221 is an equidigital number, since it uses as much as digits as its factorization.
2122102001221 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 16.
Adding to 2122102001221 its reverse (1221002012212), we get a palindrome (3343104013433).
The spelling of 2122102001221 in words is "two trillion, one hundred twenty-two billion, one hundred two million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •