110002111110 has 96 divisors (see below), whose sum is σ = 293853212640. Its totient is φ = 28529639424.

The previous prime is 110002111057. The next prime is 110002111111. The reversal of 110002111110 is 11111200011.

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 = 110002111092 and 110002111101.

It is a congruent number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11080609 + ... + 11090531.

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

Almost surely, 2^110002111110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110002111110 its reverse (11111200011), we get a palindrome (121113311121).

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