111100000111110 has 256 divisors, whose sum is σ = 311639039712000. Its totient is φ = 28127357153280.

The previous prime is 111100000111109. The next prime is 111100000111171. The reversal of 111100000111110 is 11111000001111.

It is a Harshad number since it is a multiple of its sum of digits (9).

111100000111110 is a modest number, since divided by 111110 gives 11110 as remainder.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 125693064 + ... + 126573876.

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

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

111100000111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 111100000111110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155819519856000).

111100000111110 is an abundant number, since it is smaller than the sum of its proper divisors (200539039600890).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 881128 (or 881122 counting only the distinct ones).

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

Adding to 111100000111110 its reverse (11111000001111), we get a palindrome (122211000112221).

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