Search a number
-
+
111110000001131 is a prime number
BaseRepresentation
bin11001010000110111010000…
…000101001100000001101011
3112120102000022221101020112002
4121100313100011030001223
5104030411240000014011
61032151121312041215
732255301244042415
oct3120672005140153
9476360287336462
10111110000001131
113244853940702a
1210565a4223320b
1349cc821a67561
141d61a7756b9b5
15cca35d071c3b
hex650dd014c06b

111110000001131 has 2 divisors, whose sum is σ = 111110000001132. Its totient is φ = 111110000001130.

The previous prime is 111110000001073. The next prime is 111110000001139. The reversal of 111110000001131 is 131100000011111.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 111110000001131 - 238 = 110835122094187 is a prime.

It is a super-2 number, since 2×1111100000011312 (a number of 29 digits) contains 22 as substring.

It is a Sophie Germain prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2111110000001131 is an apocalyptic number.

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

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

111110000001131 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 111110000001131 its reverse (131100000011111), we get a palindrome (242210000012242).

The spelling of 111110000001131 in words is "one hundred eleven trillion, one hundred ten billion, one thousand, one hundred thirty-one".