110110000100137 has 2 divisors, whose sum is σ = 110110000100138. Its totient is φ = 110110000100136.

The previous prime is 110110000100071. The next prime is 110110000100147. The reversal of 110110000100137 is 731001000011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67431622728976 + 42678377371161 = 8211676^2 + 6532869^2 .

It is a cyclic number.

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

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

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

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

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

It is an amenable number.

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

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

110110000100137 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 110110000100137 its reverse (731001000011011), we get a palindrome (841111000111148).

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