110111001101111 has 8 divisors (see below), whose sum is σ = 110216356617024. Its totient is φ = 110005655599840.

The previous prime is 110111001101053. The next prime is 110111001101173. The reversal of 110111001101111 is 111101100111011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19590065 + ... + 24576261.

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

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

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

110111001101111 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 5007321.

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

Adding to 110111001101111 its reverse (111101100111011), we get a palindrome (221212101212122).

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