Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …000101100100001101100111 |
3 | 112120102000022221120021102021 |
4 | 121100313100011210031213 |
5 | 104030411240011201244 |
6 | 1032151121314124011 |
7 | 32255301244634302 |
oct | 3120672005441547 |
9 | 476360287507367 |
10 | 111110000100199 |
11 | 32448539474501 |
12 | 10565a42280607 |
13 | 49cc821aa0689 |
14 | 1d61a77595b39 |
15 | cca35d091284 |
hex | 650dd0164367 |
111110000100199 has 2 divisors, whose sum is σ = 111110000100200. Its totient is φ = 111110000100198.
The previous prime is 111110000100157. The next prime is 111110000100227. The reversal of 111110000100199 is 991001000011111.
It is a strong prime.
It is an emirp because it is prime and its reverse (991001000011111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111110000100199 - 211 = 111110000098151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111110900100199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555000050099 + 55555000050100.
It is an arithmetic number, because the mean of its divisors is an integer number (55555000050100).
Almost surely, 2111110000100199 is an apocalyptic number.
111110000100199 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110000100199 is an equidigital number, since it uses as much as digits as its factorization.
111110000100199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 25.
The spelling of 111110000100199 in words is "one hundred eleven trillion, one hundred ten billion, one hundred thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.960 sec. • engine limits •