Base | Representation |
---|---|
bin | 10001101000110000111… |
… | …101011110101000111001 |
3 | 11021212101111222001022212 |
4 | 101220300331132220321 |
5 | 124324140030400441 |
6 | 2324441445224505 |
7 | 153364354502066 |
oct | 21506075365071 |
9 | 4255344861285 |
10 | 1212002200121 |
11 | 428009710749 |
12 | 176a89102135 |
13 | 8a3a303ca7b |
14 | 42938559c6d |
15 | 217d8742eeb |
hex | 11a30f5ea39 |
1212002200121 has 2 divisors, whose sum is σ = 1212002200122. Its totient is φ = 1212002200120.
The previous prime is 1212002200081. The next prime is 1212002200151. The reversal of 1212002200121 is 1210022002121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1207227390121 + 4774810000 = 1098739^2 + 69100^2 .
It is an emirp because it is prime and its reverse (1210022002121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1212002200121 - 230 = 1210928458297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1212002200096 and 1212002200105.
It is not a weakly prime, because it can be changed into another prime (1212002200151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606001100060 + 606001100061.
It is an arithmetic number, because the mean of its divisors is an integer number (606001100061).
Almost surely, 21212002200121 is an apocalyptic number.
It is an amenable number.
1212002200121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212002200121 is an equidigital number, since it uses as much as digits as its factorization.
1212002200121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1212002200121 its reverse (1210022002121), we get a palindrome (2422024202242).
The spelling of 1212002200121 in words is "one trillion, two hundred twelve billion, two million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •