Base | Representation |
---|---|
bin | 1010111010100011111111… |
… | …0111110001011011010111 |
3 | 1120111022012222022010211022 |
4 | 2232220333313301123113 |
5 | 3033111434303210012 |
6 | 41305140241031355 |
7 | 2346026114433404 |
oct | 256507767613327 |
9 | 46438188263738 |
10 | 12001210210007 |
11 | 3907759324567 |
12 | 1419ab902555b |
13 | 69092b34a395 |
14 | 2d6c0c6092ab |
15 | 15c2a42c6472 |
hex | aea3fdf16d7 |
12001210210007 has 2 divisors, whose sum is σ = 12001210210008. Its totient is φ = 12001210210006.
The previous prime is 12001210209929. The next prime is 12001210210069. The reversal of 12001210210007 is 70001201210021.
It is a strong prime.
It is an emirp because it is prime and its reverse (70001201210021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12001210210007 - 218 = 12001209947863 is a prime.
It is a super-2 number, since 2×120012102100072 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12001210210807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000605105003 + 6000605105004.
It is an arithmetic number, because the mean of its divisors is an integer number (6000605105004).
Almost surely, 212001210210007 is an apocalyptic number.
12001210210007 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001210210007 is an equidigital number, since it uses as much as digits as its factorization.
12001210210007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 12001210210007 its reverse (70001201210021), we get a palindrome (82002411420028).
The spelling of 12001210210007 in words is "twelve trillion, one billion, two hundred ten million, two hundred ten thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •