Base | Representation |
---|---|
bin | 10001101000110000110… |
… | …101001010011000111101 |
3 | 11021212101100212021210201 |
4 | 101220300311022120331 |
5 | 124324134001120104 |
6 | 2324441330403501 |
7 | 153364330122121 |
oct | 21506065123075 |
9 | 4255340767721 |
10 | 1212000020029 |
11 | 428008461817 |
12 | 176a88430591 |
13 | 8a3a2758686 |
14 | 4293814d581 |
15 | 217d84620a4 |
hex | 11a30d4a63d |
1212000020029 has 2 divisors, whose sum is σ = 1212000020030. Its totient is φ = 1212000020028.
The previous prime is 1212000019963. The next prime is 1212000020047. The reversal of 1212000020029 is 9200200002121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1209582036100 + 2417983929 = 1099810^2 + 49173^2 .
It is an emirp because it is prime and its reverse (9200200002121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1212000020029 - 211 = 1212000017981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1212000019988 and 1212000020015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212000029029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606000010014 + 606000010015.
It is an arithmetic number, because the mean of its divisors is an integer number (606000010015).
Almost surely, 21212000020029 is an apocalyptic number.
It is an amenable number.
1212000020029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212000020029 is an equidigital number, since it uses as much as digits as its factorization.
1212000020029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
The spelling of 1212000020029 in words is "one trillion, two hundred twelve billion, twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •