Base | Representation |
---|---|
bin | 10111001100010010111111… |
… | …110010011011001010001111 |
3 | 111101011010002102020022211002 |
4 | 113030102333302123022033 |
5 | 101332132201324341421 |
6 | 1000534111032450515 |
7 | 30325156406216261 |
oct | 2714227762331217 |
9 | 441133072208732 |
10 | 102000101012111 |
11 | 2a555aaa97a945 |
12 | b534377549a3b |
13 | 44bb7505b66a3 |
14 | 1b28b8cc77b31 |
15 | bbd3cb5a1b0b |
hex | 5cc4bfc9b28f |
102000101012111 has 2 divisors, whose sum is σ = 102000101012112. Its totient is φ = 102000101012110.
The previous prime is 102000101012107. The next prime is 102000101012129. The reversal of 102000101012111 is 111210101000201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102000101012111 - 22 = 102000101012107 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102000101012092 and 102000101012101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102000101012141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000050506055 + 51000050506056.
It is an arithmetic number, because the mean of its divisors is an integer number (51000050506056).
Almost surely, 2102000101012111 is an apocalyptic number.
102000101012111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000101012111 is an equidigital number, since it uses as much as digits as its factorization.
102000101012111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102000101012111 its reverse (111210101000201), we get a palindrome (213210202012312).
The spelling of 102000101012111 in words is "one hundred two trillion, one hundred one million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •