Base | Representation |
---|---|
bin | 101111000101010111… |
… | …1101101110011101101 |
3 | 100122222200002101221211 |
4 | 1132022233231303231 |
5 | 3124034133341023 |
6 | 114241125154421 |
7 | 10206435631015 |
oct | 1361257556355 |
9 | 318880071854 |
10 | 101112012013 |
11 | 399771051a1 |
12 | 1771a25ba11 |
13 | 96c5007a0c |
14 | 4c72a08c45 |
15 | 296bb94a0d |
hex | 178abedced |
101112012013 has 2 divisors, whose sum is σ = 101112012014. Its totient is φ = 101112012012.
The previous prime is 101112011947. The next prime is 101112012031. The reversal of 101112012013 is 310210211101.
It is a happy number.
Together with next prime (101112012031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97520047524 + 3591964489 = 312282^2 + 59933^2 .
It is a cyclic number.
It is not a de Polignac number, because 101112012013 - 29 = 101112011501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101112011984 and 101112012002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101112012713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556006006 + 50556006007.
It is an arithmetic number, because the mean of its divisors is an integer number (50556006007).
Almost surely, 2101112012013 is an apocalyptic number.
It is an amenable number.
101112012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112012013 is an equidigital number, since it uses as much as digits as its factorization.
101112012013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101112012013 its reverse (310210211101), we get a palindrome (411322223114).
The spelling of 101112012013 in words is "one hundred one billion, one hundred twelve million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.194 sec. • engine limits •