101111111131111 has 2 divisors, whose sum is σ = 101111111131112. Its totient is φ = 101111111131110.

The previous prime is 101111111131073. The next prime is 101111111131127. The reversal of 101111111131111 is 111131111111101.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101111111131111 - 2⁷ = 101111111130983 is a prime.

It is a congruent number.

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

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

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

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

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

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

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

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

Adding to 101111111131111 its reverse (111131111111101), we get a palindrome (212242222242212).

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