Base | Representation |
---|---|
bin | 11001010000110111010110… |
… | …101100111111110011101011 |
3 | 112120102000121200102122201011 |
4 | 121100313112230333303223 |
5 | 104030412001420201024 |
6 | 1032151140321204351 |
7 | 32255304063262264 |
oct | 3120672654776353 |
9 | 476360550378634 |
10 | 111110111100139 |
11 | 32448596099398 |
12 | 10565a734906b7 |
13 | 49cc83ba95c08 |
14 | 1d61a8820b96b |
15 | cca367bba094 |
hex | 650dd6b3fceb |
111110111100139 has 2 divisors, whose sum is σ = 111110111100140. Its totient is φ = 111110111100138.
The previous prime is 111110111100127. The next prime is 111110111100167. The reversal of 111110111100139 is 931001111011111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 111110111100139 - 221 = 111110109002987 is a prime.
It is not a weakly prime, because it can be changed into another prime (111110111100239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555055550069 + 55555055550070.
It is an arithmetic number, because the mean of its divisors is an integer number (55555055550070).
Almost surely, 2111110111100139 is an apocalyptic number.
111110111100139 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110111100139 is an equidigital number, since it uses as much as digits as its factorization.
111110111100139 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 22.
The spelling of 111110111100139 in words is "one hundred eleven trillion, one hundred ten billion, one hundred eleven million, one hundred thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •