Base | Representation |
---|---|
bin | 10011000101111010000… |
… | …001000000100010110001 |
3 | 11122102112101020212101011 |
4 | 103011322001000202301 |
5 | 132444000100010001 |
6 | 2442421404510521 |
7 | 163534611633265 |
oct | 23057201004261 |
9 | 4572471225334 |
10 | 1312012110001 |
11 | 46646a6a522a |
12 | 19233a24b441 |
13 | 9695090c038 |
14 | 47704a3a0a5 |
15 | 241dd788d51 |
hex | 1317a0408b1 |
1312012110001 has 2 divisors, whose sum is σ = 1312012110002. Its totient is φ = 1312012110000.
The previous prime is 1312012109923. The next prime is 1312012110029. The reversal of 1312012110001 is 1000112102131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1258713461776 + 53298648225 = 1121924^2 + 230865^2 .
It is an emirp because it is prime and its reverse (1000112102131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1312012110001 - 211 = 1312012107953 is a prime.
It is a super-2 number, since 2×13120121100012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1312012110061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656006055000 + 656006055001.
It is an arithmetic number, because the mean of its divisors is an integer number (656006055001).
Almost surely, 21312012110001 is an apocalyptic number.
It is an amenable number.
1312012110001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312012110001 is an equidigital number, since it uses as much as digits as its factorization.
1312012110001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1312012110001 its reverse (1000112102131), we get a palindrome (2312124212132).
The spelling of 1312012110001 in words is "one trillion, three hundred twelve billion, twelve million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •