110111012111 has 2 divisors, whose sum is σ = 110111012112. Its totient is φ = 110111012110.

The previous prime is 110111012071. The next prime is 110111012129. The reversal of 110111012111 is 111210111011.

It is a happy number.

It is a strong prime.

It is an emirp because it is prime and its reverse (111210111011) is a distict prime.

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 110111012092 and 110111012101.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2^110111012111 is an apocalyptic number.

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

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

110111012111 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 110111012111 its reverse (111210111011), we get a palindrome (221321123122).

The spelling of 110111012111 in words is "one hundred ten billion, one hundred eleven million, twelve thousand, one hundred eleven".