110111111112 has 64 divisors (see below), whose sum is σ = 282903768000. Its totient is φ = 35688211200.

The previous prime is 110111111101. The next prime is 110111111147. The reversal of 110111111112 is 211111111011.

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

It is an unprimeable number.

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 in 15 ways as a sum of consecutive naturals, for example, 1335487 + ... + 1415537.

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

Almost surely, 2^110111111112 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 12.

Adding to 110111111112 its reverse (211111111011), we get a palindrome (321222222123).

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