10111012110 has 160 divisors (see below), whose sum is σ = 28258243200. Its totient is φ = 2590963200.

The previous prime is 10111012097. The next prime is 10111012141. The reversal of 10111012110 is 1121011101.

10111012110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 = 10111012092 and 10111012101.

It is a congruent number.

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 79 ways as a sum of consecutive naturals, for example, 5613210 + ... + 5615010.

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

Almost surely, 2^10111012110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10111012110 its reverse (1121011101), we get a palindrome (11232023211).

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