Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …001000100011000100111111 |
3 | 111101012011020211012001021211 |
4 | 113030131022020203010333 |
5 | 101332322023033031421 |
6 | 1000543113441105251 |
7 | 30326023655131612 |
oct | 2714351210430477 |
9 | 441164224161254 |
10 | 102011012002111 |
11 | 2a55a699943153 |
12 | b536501628227 |
13 | 44bc79bc478a4 |
14 | 1b29505db8179 |
15 | bbd81940c9e1 |
hex | 5cc74a22313f |
102011012002111 has 2 divisors, whose sum is σ = 102011012002112. Its totient is φ = 102011012002110.
The previous prime is 102011012002037. The next prime is 102011012002157. The reversal of 102011012002111 is 111200210110201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102011012002111 - 217 = 102011011871039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102011012002091 and 102011012002100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011012002411) 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, 51005506001055 + 51005506001056.
It is an arithmetic number, because the mean of its divisors is an integer number (51005506001056).
Almost surely, 2102011012002111 is an apocalyptic number.
102011012002111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011012002111 is an equidigital number, since it uses as much as digits as its factorization.
102011012002111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102011012002111 its reverse (111200210110201), we get a palindrome (213211222112312).
The spelling of 102011012002111 in words is "one hundred two trillion, eleven billion, twelve million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •