111010100100127 has 2 divisors, whose sum is σ = 111010100100128. Its totient is φ = 111010100100126.

The previous prime is 111010100100083. The next prime is 111010100100143. The reversal of 111010100100127 is 721001001010111.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 111010100100127 - 2⁷ = 111010100099999 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2^{111010100100127} is an apocalyptic number.

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

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

111010100100127 is an evil number, because the sum of its binary digits is even.

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

Adding to 111010100100127 its reverse (721001001010111), we get a palindrome (832011101110238).

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