110110110100110 has 160 divisors (see below), whose sum is σ = 297547423965792. Its totient is φ = 29216788128000.

The previous prime is 110110110099967. The next prime is 110110110100129. The reversal of 110110110100110 is 11001011011011.

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 = 110110110100092 and 110110110100101.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 205685712 + ... + 206220348.

Almost surely, 2^{110110110100110} is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110110110100110 its reverse (11001011011011), we get a palindrome (121111121111121).

The spelling of 110110110100110 in words is "one hundred ten trillion, one hundred ten billion, one hundred ten million, one hundred thousand, one hundred ten".