Base | Representation |
---|---|
bin | 1001001100011111000110… |
… | …0100110010101000110011 |
3 | 1022210111222000111200010202 |
4 | 2103013301210302220303 |
5 | 2311121001404014024 |
6 | 33300304301545415 |
7 | 2062300655406242 |
oct | 223076144625063 |
9 | 38714860450122 |
10 | 10110111001139 |
11 | 32487460a9a06 |
12 | 11734a787526b |
13 | 5844c164b376 |
14 | 26d490d68959 |
15 | 127ec1b64bae |
hex | 931f1932a33 |
10110111001139 has 2 divisors, whose sum is σ = 10110111001140. Its totient is φ = 10110111001138.
The previous prime is 10110111001049. The next prime is 10110111001147. The reversal of 10110111001139 is 93110011101101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10110111001139 - 212 = 10110110997043 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110111001139.
It is not a weakly prime, because it can be changed into another prime (10110111001169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055055500569 + 5055055500570.
It is an arithmetic number, because the mean of its divisors is an integer number (5055055500570).
Almost surely, 210110111001139 is an apocalyptic number.
10110111001139 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110111001139 is an equidigital number, since it uses as much as digits as its factorization.
10110111001139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 10110111001139 in words is "ten trillion, one hundred ten billion, one hundred eleven million, one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •