101110010110110 has 96 divisors (see below), whose sum is σ = 263038891489920. Its totient is φ = 26946993945600.

The previous prime is 101110010110099. The next prime is 101110010110117. The reversal of 101110010110110 is 11011010011101.

101110010110110 is digitally balanced in base 4, 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 = 101110010110092 and 101110010110101.

It is a congruent number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1958293995 + ... + 1958345625.

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

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

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

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

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

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

101110010110110 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 101110010110110 its reverse (11011010011101), we get a palindrome (112121020121211).

Subtracting from 101110010110110 its reverse (11011010011101), we obtain a palindrome (90099000099009).

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