110111110111111 has 4 divisors (see below), whose sum is σ = 116588234235312. Its totient is φ = 103633985986912.

The previous prime is 110111110111109. The next prime is 110111110111153. The reversal of 110111110111111 is 111111011111011.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 110111110111111 - 2¹ = 110111110111109 is a prime.

It is a super-2 number, since 2×110111110111111² (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110111110141111) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3238562062075 + ... + 3238562062108.

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

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

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

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

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

The sum of its prime factors is 6477124124200.

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

Adding to 110111110111111 its reverse (111111011111011), we get a palindrome (221222121222122).

It can be divided in two parts, 11011111011 and 1111, that multiplied together give a palindrome (12233344333221).

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