Base | Representation |
---|---|
bin | 10001101001001010000… |
… | …100010001101000000101 |
3 | 11021220110212112211201022 |
4 | 101221022010101220011 |
5 | 124331020343142404 |
6 | 2324551333240525 |
7 | 153410660651531 |
oct | 21511204215005 |
9 | 4256425484638 |
10 | 1212423412229 |
11 | 428205454627 |
12 | 176b86193145 |
13 | 8a43c39a3c3 |
14 | 42978482bc1 |
15 | 218106e68be |
hex | 11a4a111a05 |
1212423412229 has 2 divisors, whose sum is σ = 1212423412230. Its totient is φ = 1212423412228.
The previous prime is 1212423412183. The next prime is 1212423412231. The reversal of 1212423412229 is 9222143242121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1052415412129 + 160008000100 = 1025873^2 + 400010^2 .
It is an emirp because it is prime and its reverse (9222143242121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1212423412229 is a prime.
It is a Sophie Germain prime.
Together with 1212423412231, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212423417229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606211706114 + 606211706115.
It is an arithmetic number, because the mean of its divisors is an integer number (606211706115).
Almost surely, 21212423412229 is an apocalyptic number.
It is an amenable number.
1212423412229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212423412229 is an equidigital number, since it uses as much as digits as its factorization.
1212423412229 is an evil number, because the sum of its binary digits is even.
The product of its digits is 27648, while the sum is 35.
The spelling of 1212423412229 in words is "one trillion, two hundred twelve billion, four hundred twenty-three million, four hundred twelve thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •