111010011117101 has 2 divisors, whose sum is σ = 111010011117102. Its totient is φ = 111010011117100.

The previous prime is 111010011117077. The next prime is 111010011117113. The reversal of 111010011117101 is 101711110010111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94846153732201 + 16163857384900 = 9738899^2 + 4020430^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

111010011117101 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 7, while the sum is 17.

Adding to 111010011117101 its reverse (101711110010111), we get a palindrome (212721121127212).

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