Search a number
-
+
111010011101131 is a prime number
BaseRepresentation
bin11001001111011010001000…
…010001110011011111001011
3112120001110020112121211121111
4121033122020101303133023
5104022242000320214011
61032033143422551151
732245131363314422
oct3117321021633713
9476043215554544
10111010011101131
113240a09927258a
121054a5981384b7
1349c327864327c
141d5acadb9a2b9
15cc7959ccb121
hex64f6884737cb

111010011101131 has 2 divisors, whose sum is σ = 111010011101132. Its totient is φ = 111010011101130.

The previous prime is 111010011101113. The next prime is 111010011101167. The reversal of 111010011101131 is 131101110010111.

It is a happy number.

Together with previous prime (111010011101113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 111010011101131 - 223 = 111010002712523 is a prime.

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

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

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

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

Almost surely, 2111010011101131 is an apocalyptic number.

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

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

111010011101131 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 13.

Adding to 111010011101131 its reverse (131101110010111), we get a palindrome (242111121111242).

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