101111010110137 has 2 divisors, whose sum is σ = 101111010110138. Its totient is φ = 101111010110136.

The previous prime is 101111010110081. The next prime is 101111010110183. The reversal of 101111010110137 is 731011010111101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100015280583696 + 1095729526441 = 10000764^2 + 1046771^2 .

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

It is a cyclic number.

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

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

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

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

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

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

It is an amenable number.

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

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

101111010110137 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 19.

Adding to 101111010110137 its reverse (731011010111101), we get a palindrome (832122020221238).

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