110100111120101 has 2 divisors, whose sum is σ = 110100111120102. Its totient is φ = 110100111120100.

The previous prime is 110100111120031. The next prime is 110100111120163. The reversal of 110100111120101 is 101021111001011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 61931375383201 + 48168735736900 = 7869649^2 + 6940370^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 11.

Adding to 110100111120101 its reverse (101021111001011), we get a palindrome (211121222121112).

The spelling of 110100111120101 in words is "one hundred ten trillion, one hundred billion, one hundred eleven million, one hundred twenty thousand, one hundred one".