Base | Representation |
---|---|
bin | 11101011001011101100… |
… | …01110000111101110001 |
3 | 10120120020202022220002112 |
4 | 32230232301300331301 |
5 | 113022142120041423 |
6 | 2052011241455105 |
7 | 132656162200643 |
oct | 16545661607561 |
9 | 3516222286075 |
10 | 1010102112113 |
11 | 35a422344286 |
12 | 1439211a1495 |
13 | 74338188c83 |
14 | 36c63d8a893 |
15 | 1b41d594a78 |
hex | eb2ec70f71 |
1010102112113 has 2 divisors, whose sum is σ = 1010102112114. Its totient is φ = 1010102112112.
The previous prime is 1010102112073. The next prime is 1010102112143. The reversal of 1010102112113 is 3112112010101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1007991904144 + 2110207969 = 1003988^2 + 45937^2 .
It is an emirp because it is prime and its reverse (3112112010101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010102112113 - 220 = 1010101063537 is a prime.
It is not a weakly prime, because it can be changed into another prime (1010102112143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505051056056 + 505051056057.
It is an arithmetic number, because the mean of its divisors is an integer number (505051056057).
Almost surely, 21010102112113 is an apocalyptic number.
It is an amenable number.
1010102112113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010102112113 is an equidigital number, since it uses as much as digits as its factorization.
1010102112113 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 14.
Adding to 1010102112113 its reverse (3112112010101), we get a palindrome (4122214122214).
The spelling of 1010102112113 in words is "one trillion, ten billion, one hundred two million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •