12010110111157 has 2 divisors, whose sum is σ = 12010110111158. Its totient is φ = 12010110111156.

The previous prime is 12010110111113. The next prime is 12010110111179. The reversal of 12010110111157 is 75111101101021.

It is a happy number.

It is an a-pointer prime, because the next prime (12010110111179) can be obtained adding 12010110111157 to its sum of digits (22).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10549205186116 + 1460904925041 = 3247954^2 + 1208679^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70, while the sum is 22.

Adding to 12010110111157 its reverse (75111101101021), we get a palindrome (87121211212178).

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