Search a number
-
+
111110001111119 is a prime number
BaseRepresentation
bin11001010000110111010000…
…001001011011000001001111
3112120102000100000110122010202
4121100313100021123001033
5104030411240241023434
61032151121351524115
732255301256344503
oct3120672011330117
9476360300418122
10111110001111119
1132448539aa4a7a
1210565a4268963b
1349cc82206585a
141d61a7777a303
15cca35d1e0a7e
hex650dd025b04f

111110001111119 has 2 divisors, whose sum is σ = 111110001111120. Its totient is φ = 111110001111118.

The previous prime is 111110001111089. The next prime is 111110001111139. The reversal of 111110001111119 is 911111100011111.

It is an a-pointer prime, because the next prime (111110001111139) can be obtained adding 111110001111119 to its sum of digits (20).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 111110001111119 - 28 = 111110001110863 is a prime.

It is a super-2 number, since 2×1111100011111192 (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 111110001111119.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (111110001111139) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555000555559 + 55555000555560.

It is an arithmetic number, because the mean of its divisors is an integer number (55555000555560).

Almost surely, 2111110001111119 is an apocalyptic number.

111110001111119 is a deficient number, since it is larger than the sum of its proper divisors (1).

111110001111119 is an equidigital number, since it uses as much as digits as its factorization.

111110001111119 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 111110001111119 in words is "one hundred eleven trillion, one hundred ten billion, one million, one hundred eleven thousand, one hundred nineteen".