Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …100111000110101001011111 |
3 | 111101012011021101020222222002 |
4 | 113030131022213012221133 |
5 | 101332322032110342002 |
6 | 1000543114324512515 |
7 | 30326024113202462 |
oct | 2714351247065137 |
9 | 441164241228862 |
10 | 102011020012127 |
11 | 2a55a6a34141a6 |
12 | b53650424b73b |
13 | 44bc7a07c0745 |
14 | 1b295070a12d9 |
15 | bbd819e91002 |
hex | 5cc74a9c6a5f |
102011020012127 has 2 divisors, whose sum is σ = 102011020012128. Its totient is φ = 102011020012126.
The previous prime is 102011020012093. The next prime is 102011020012159. The reversal of 102011020012127 is 721210020110201.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (721210020110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011020012127 - 26 = 102011020012063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102011020012099 and 102011020012108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011020032127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005510006063 + 51005510006064.
It is an arithmetic number, because the mean of its divisors is an integer number (51005510006064).
Almost surely, 2102011020012127 is an apocalyptic number.
102011020012127 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011020012127 is an equidigital number, since it uses as much as digits as its factorization.
102011020012127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 102011020012127 its reverse (721210020110201), we get a palindrome (823221040122328).
The spelling of 102011020012127 in words is "one hundred two trillion, eleven billion, twenty million, twelve thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •