Base | Representation |
---|---|
bin | 1011000001101010110110… |
… | …0110101110101010101101 |
3 | 1120220222101100012102001111 |
4 | 2300122231212232222231 |
5 | 3042112014420222201 |
6 | 41441212154112021 |
7 | 2360610634312345 |
oct | 260325546565255 |
9 | 46828340172044 |
10 | 12123310320301 |
11 | 3954515692624 |
12 | 14396b411b611 |
13 | 69c2b966085b |
14 | 2dcab2829d25 |
15 | 16054d816b51 |
hex | b06ad9aeaad |
12123310320301 has 2 divisors, whose sum is σ = 12123310320302. Its totient is φ = 12123310320300.
The previous prime is 12123310320239. The next prime is 12123310320343. The reversal of 12123310320301 is 10302301332121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6272470160100 + 5850840160201 = 2504490^2 + 2418851^2 .
It is an emirp because it is prime and its reverse (10302301332121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12123310320301 - 225 = 12123276765869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12123310320371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6061655160150 + 6061655160151.
It is an arithmetic number, because the mean of its divisors is an integer number (6061655160151).
Almost surely, 212123310320301 is an apocalyptic number.
It is an amenable number.
12123310320301 is a deficient number, since it is larger than the sum of its proper divisors (1).
12123310320301 is an equidigital number, since it uses as much as digits as its factorization.
12123310320301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12123310320301 its reverse (10302301332121), we get a palindrome (22425611652422).
The spelling of 12123310320301 in words is "twelve trillion, one hundred twenty-three billion, three hundred ten million, three hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •