101110000010137 has 2 divisors, whose sum is σ = 101110000010138. Its totient is φ = 101110000010136.

The previous prime is 101110000010093. The next prime is 101110000010183. The reversal of 101110000010137 is 731010000011101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 88226645553216 + 12883354456921 = 9392904^2 + 3589339^2 .

It is a cyclic number.

It is not a de Polignac number, because 101110000010137 - 2³⁵ = 101075640271769 is a prime.

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

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

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

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

It is an amenable number.

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

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

101110000010137 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 101110000010137 its reverse (731010000011101), we get a palindrome (832120000021238).

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