Base | Representation |
---|---|
bin | 101111001000010110… |
… | …1100100100011011001 |
3 | 100200020122110001211222 |
4 | 1132100231210203121 |
5 | 3124240300104423 |
6 | 114255102501425 |
7 | 10212062523656 |
oct | 1362055444331 |
9 | 320218401758 |
10 | 101212113113 |
11 | 39a18665681 |
12 | 17747894875 |
13 | 970c985537 |
14 | 4c82024c2d |
15 | 29758693c8 |
hex | 1790b648d9 |
101212113113 has 2 divisors, whose sum is σ = 101212113114. Its totient is φ = 101212113112.
The previous prime is 101212113047. The next prime is 101212113151. The reversal of 101212113113 is 311311212101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61430613904 + 39781499209 = 247852^2 + 199453^2 .
It is an emirp because it is prime and its reverse (311311212101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101212113113 - 232 = 96917145817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101212113091 and 101212113100.
It is not a weakly prime, because it can be changed into another prime (101212113193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50606056556 + 50606056557.
It is an arithmetic number, because the mean of its divisors is an integer number (50606056557).
Almost surely, 2101212113113 is an apocalyptic number.
It is an amenable number.
101212113113 is a deficient number, since it is larger than the sum of its proper divisors (1).
101212113113 is an equidigital number, since it uses as much as digits as its factorization.
101212113113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 101212113113 its reverse (311311212101), we get a palindrome (412523325214).
The spelling of 101212113113 in words is "one hundred one billion, two hundred twelve million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •