Search a number
-
+
111011101027 is a prime number
BaseRepresentation
bin110011101100011000…
…1101111100101100011
3101121112112222020020021
41213120301233211203
53304322320213102
6122555305054311
711006646534601
oct1473061574543
9347475866207
10111011101027
11430969662a2
1219621487397
13a611b22b38
1455315c0871
152d4ac6d137
hex19d8c6f963

111011101027 has 2 divisors, whose sum is σ = 111011101028. Its totient is φ = 111011101026.

The previous prime is 111011101001. The next prime is 111011101043. The reversal of 111011101027 is 720101110111.

It is an a-pointer prime, because the next prime (111011101043) can be obtained adding 111011101027 to its sum of digits (16).

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-111011101027 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 111011101027.

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

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

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

Almost surely, 2111011101027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 14, while the sum is 16.

Adding to 111011101027 its reverse (720101110111), we get a palindrome (831112211138).

The spelling of 111011101027 in words is "one hundred eleven billion, eleven million, one hundred one thousand, twenty-seven".