Base | Representation |
---|---|
bin | 11001010000110111010110… |
… | …000011000100111100001111 |
3 | 112120102000120220202100121102 |
4 | 121100313112003010330033 |
5 | 104030411441112023434 |
6 | 1032151135245453315 |
7 | 32255303601003314 |
oct | 3120672603047417 |
9 | 476360526670542 |
10 | 111110100111119 |
11 | 3244858a97315a |
12 | 10565a6b87123b |
13 | 49cc839719135 |
14 | 1d61a8698ad0b |
15 | cca366c4907e |
hex | 650dd60c4f0f |
111110100111119 has 2 divisors, whose sum is σ = 111110100111120. Its totient is φ = 111110100111118.
The previous prime is 111110100111037. The next prime is 111110100111181. The reversal of 111110100111119 is 911111001011111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111110100111119 - 228 = 111109831675663 is a prime.
It is a super-2 number, since 2×1111101001111192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111110100111119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111110100111319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555050055559 + 55555050055560.
It is an arithmetic number, because the mean of its divisors is an integer number (55555050055560).
Almost surely, 2111110100111119 is an apocalyptic number.
111110100111119 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110100111119 is an equidigital number, since it uses as much as digits as its factorization.
111110100111119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 20.
The spelling of 111110100111119 in words is "one hundred eleven trillion, one hundred ten billion, one hundred million, one hundred eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •