111100000011101 has 2 divisors, whose sum is σ = 111100000011102. Its totient is φ = 111100000011100.

The previous prime is 111100000011053. The next prime is 111100000011109. The reversal of 111100000011101 is 101110000001111.

It is an a-pointer prime, because the next prime (111100000011109) can be obtained adding 111100000011101 to its sum of digits (8).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 71079636403876 + 40020363607225 = 8430874^2 + 6326165^2 .

It is a cyclic number.

It is not a de Polignac number, because 111100000011101 - 2²⁶ = 111099932902237 is a prime.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1, while the sum is 8.

Adding to 111100000011101 its reverse (101110000001111), we get a palindrome (212210000012212).

It can be divided in two parts, 11110000001110 and 1, that added together give a palindrome (11110000001111).

The spelling of 111100000011101 in words is "one hundred eleven trillion, one hundred billion, eleven thousand, one hundred one".