110100011112 has 384 divisors, whose sum is σ = 378383765760. Its totient is φ = 28142899200.

The previous prime is 110100011059. The next prime is 110100011171. The reversal of 110100011112 is 211110001011.

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

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

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 95 ways as a sum of consecutive naturals, for example, 75877987 + ... + 75879437.

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

Almost surely, 2^110100011112 is an apocalyptic number.

110100011112 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 110100011112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189191882880).

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

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

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

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

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

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

Adding to 110100011112 its reverse (211110001011), we get a palindrome (321210012123).

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