110102110110 has 40 divisors (see below), whose sum is σ = 296052342696. Its totient is φ = 29360562480.

The previous prime is 110102110109. The next prime is 110102110117. The reversal of 110102110110 is 11011201011.

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 = 110102110092 and 110102110101.

It is a congruent number.

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

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 67963456 + ... + 67965075.

Almost surely, 2^110102110110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110102110110 its reverse (11011201011), we get a palindrome (121113311121).

Subtracting from 110102110110 its reverse (11011201011), we obtain a palindrome (99090909099).

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