Base | Representation |
---|---|
bin | 10001101000110010001… |
… | …001011101111010111001 |
3 | 11021212102220110002102122 |
4 | 101220302021131322321 |
5 | 124324210130320441 |
6 | 2324443440211025 |
7 | 153365016015641 |
oct | 21506211357271 |
9 | 4255386402378 |
10 | 1212022120121 |
11 | 42801998695a |
12 | 176a93909a75 |
13 | 8a3a71c5957 |
14 | 4293b063521 |
15 | 217da37a34b |
hex | 11a3225deb9 |
1212022120121 has 2 divisors, whose sum is σ = 1212022120122. Its totient is φ = 1212022120120.
The previous prime is 1212022120079. The next prime is 1212022120129. The reversal of 1212022120121 is 1210212202121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1110570314896 + 101451805225 = 1053836^2 + 318515^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212022120121 - 210 = 1212022119097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1212022120121.
It is not a weakly prime, because it can be changed into another prime (1212022120129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606011060060 + 606011060061.
It is an arithmetic number, because the mean of its divisors is an integer number (606011060061).
Almost surely, 21212022120121 is an apocalyptic number.
It is an amenable number.
1212022120121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212022120121 is an equidigital number, since it uses as much as digits as its factorization.
1212022120121 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 17.
Adding to 1212022120121 its reverse (1210212202121), we get a palindrome (2422234322242).
The spelling of 1212022120121 in words is "one trillion, two hundred twelve billion, twenty-two million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •