10111010137 has 2 divisors, whose sum is σ = 10111010138. Its totient is φ = 10111010136.

The previous prime is 10111010099. The next prime is 10111010171. The reversal of 10111010137 is 73101011101.

10111010137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8126842201 + 1984167936 = 90149^2 + 44544^2 .

It is a cyclic number.

It is not a de Polignac number, because 10111010137 - 2¹⁵ = 10110977369 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10111010237) 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, 5055505068 + 5055505069.

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

Almost surely, 2^10111010137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 10111010137 its reverse (73101011101), we get a palindrome (83212021238).

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