101111110157 has 2 divisors, whose sum is σ = 101111110158. Its totient is φ = 101111110156.

The previous prime is 101111110127. The next prime is 101111110183. The reversal of 101111110157 is 751011111101.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 101010188041 + 100922116 = 317821^2 + 10046^2 .

It is an emirp because it is prime and its reverse (751011111101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 101111110157 - 2³⁴ = 83931240973 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2^101111110157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 35, while the sum is 20.

Adding to 101111110157 its reverse (751011111101), we get a palindrome (852122221258).

The spelling of 101111110157 in words is "one hundred one billion, one hundred eleven million, one hundred ten thousand, one hundred fifty-seven".