Base | Representation |
---|---|
bin | 10111001101111011001110… |
… | …000101110000010010011111 |
3 | 111101112210221112221112022111 |
4 | 113031323032011300102133 |
5 | 101341000344042010421 |
6 | 1001101335421054451 |
7 | 30336230541651151 |
oct | 2715731605602237 |
9 | 441483845845274 |
10 | 102112010110111 |
11 | 2a59950771a5a1 |
12 | b551ba96b7427 |
13 | 44c9176481281 |
14 | 1b30367812ad1 |
15 | bc127b0a2ee1 |
hex | 5cdece17049f |
102112010110111 has 2 divisors, whose sum is σ = 102112010110112. Its totient is φ = 102112010110110.
The previous prime is 102112010110043. The next prime is 102112010110183. The reversal of 102112010110111 is 111011010211201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102112010110111 - 235 = 102077650371743 is a prime.
It is a super-2 number, since 2×1021120101101112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102112010110091 and 102112010110100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102112010117111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51056005055055 + 51056005055056.
It is an arithmetic number, because the mean of its divisors is an integer number (51056005055056).
Almost surely, 2102112010110111 is an apocalyptic number.
102112010110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102112010110111 is an equidigital number, since it uses as much as digits as its factorization.
102112010110111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 102112010110111 its reverse (111011010211201), we get a palindrome (213123020321312).
The spelling of 102112010110111 in words is "one hundred two trillion, one hundred twelve billion, ten million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •