110110101110100 has 432 divisors, whose sum is σ = 427386367105152. Its totient is φ = 23089490795520.

The previous prime is 110110101110099. The next prime is 110110101110117. The reversal of 110110101110100 is 1011101011011.

110110101110100 is digitally balanced in base 3, 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 congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 9225634 + ... + 17473766.

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

110110101110100 is a gapful number since it is divisible by the number (10) 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 110110101110100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213693183552576).

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

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

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

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

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

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

Adding to 110110101110100 its reverse (1011101011011), we get a palindrome (111121202121111).

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