Base | Representation |
---|---|
bin | 11001000000111000110000… |
… | …010001000110101110011111 |
3 | 112102112001110112210200012111 |
4 | 121000320300101012232133 |
5 | 103404414241120010421 |
6 | 1025550510110014451 |
7 | 32113053305664445 |
oct | 3100706021065637 |
9 | 472461415720174 |
10 | 110012102110111 |
11 | 320649636a4693 |
12 | 104090ba4a7427 |
13 | 4950134638066 |
14 | 1d2488533cb95 |
15 | caba01e02ee1 |
hex | 640e30446b9f |
110012102110111 has 2 divisors, whose sum is σ = 110012102110112. Its totient is φ = 110012102110110.
The previous prime is 110012102110069. The next prime is 110012102110117. The reversal of 110012102110111 is 111011201210011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110012102110111 - 225 = 110012068555679 is a prime.
It is a super-2 number, since 2×1100121021101112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110012102110091 and 110012102110100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110012102110117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55006051055055 + 55006051055056.
It is an arithmetic number, because the mean of its divisors is an integer number (55006051055056).
Almost surely, 2110012102110111 is an apocalyptic number.
110012102110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110012102110111 is an equidigital number, since it uses as much as digits as its factorization.
110012102110111 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 13.
Adding to 110012102110111 its reverse (111011201210011), we get a palindrome (221023303320122).
The spelling of 110012102110111 in words is "one hundred ten trillion, twelve billion, one hundred two million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •