110110000110102 has 32 divisors (see below), whose sum is σ = 259082353202400. Its totient is φ = 34544313759744.

The previous prime is 110110000110101. The next prime is 110110000110137. The reversal of 110110000110102 is 201011000011011.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

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

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 15 ways as a sum of consecutive naturals, for example, 59972766027 + ... + 59972767862.

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

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

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

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

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

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

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

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

Adding to 110110000110102 its reverse (201011000011011), we get a palindrome (311121000121113).

Subtracting 110110000110102 from its reverse (201011000011011), we obtain a palindrome (90900999900909).

The spelling of 110110000110102 in words is "one hundred ten trillion, one hundred ten billion, one hundred ten thousand, one hundred two".