Base | Representation |
---|---|
bin | 10001110000001101110… |
… | …010110000000110111001 |
3 | 11022122001001020002111012 |
4 | 101300031302300012321 |
5 | 124442031020320441 |
6 | 2332243343243305 |
7 | 154066534630031 |
oct | 21601562600671 |
9 | 4278031202435 |
10 | 1220002120121 |
11 | 430444433a84 |
12 | 1785402a9535 |
13 | 8b079555645 |
14 | 43096c028c1 |
15 | 21b05c249eb |
hex | 11c0dcb01b9 |
1220002120121 has 2 divisors, whose sum is σ = 1220002120122. Its totient is φ = 1220002120120.
The previous prime is 1220002119997. The next prime is 1220002120123. The reversal of 1220002120121 is 1210212000221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 700341354496 + 519660765625 = 836864^2 + 720875^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220002120121 - 214 = 1220002103737 is a prime.
Together with 1220002120123, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1220002120096 and 1220002120105.
It is not a weakly prime, because it can be changed into another prime (1220002120123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610001060060 + 610001060061.
It is an arithmetic number, because the mean of its divisors is an integer number (610001060061).
Almost surely, 21220002120121 is an apocalyptic number.
It is an amenable number.
1220002120121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220002120121 is an equidigital number, since it uses as much as digits as its factorization.
1220002120121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1220002120121 its reverse (1210212000221), we get a palindrome (2430214120342).
The spelling of 1220002120121 in words is "one trillion, two hundred twenty billion, two million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •