Base | Representation |
---|---|
bin | 1010111011001101011000… |
… | …1101001001110101101101 |
3 | 1120112100220101201102112121 |
4 | 2232303112031021311231 |
5 | 3033302214004111023 |
6 | 41314215032232541 |
7 | 2346601355056513 |
oct | 256632615116555 |
9 | 46470811642477 |
10 | 12012322332013 |
11 | 3911440883273 |
12 | 142009a53b751 |
13 | 6919ac570bc3 |
14 | 2d75843444b3 |
15 | 15c704b11d5d |
hex | aecd6349d6d |
12012322332013 has 2 divisors, whose sum is σ = 12012322332014. Its totient is φ = 12012322332012.
The previous prime is 12012322332007. The next prime is 12012322332037. The reversal of 12012322332013 is 31023322321021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10013794433764 + 1998527898249 = 3164458^2 + 1413693^2 .
It is an emirp because it is prime and its reverse (31023322321021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12012322332013 - 221 = 12012320234861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12012322332113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6006161166006 + 6006161166007.
It is an arithmetic number, because the mean of its divisors is an integer number (6006161166007).
Almost surely, 212012322332013 is an apocalyptic number.
It is an amenable number.
12012322332013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12012322332013 is an equidigital number, since it uses as much as digits as its factorization.
12012322332013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 12012322332013 its reverse (31023322321021), we get a palindrome (43035644653034).
The spelling of 12012322332013 in words is "twelve trillion, twelve billion, three hundred twenty-two million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •