10110110100111 has 24 divisors (see below), whose sum is σ = 16689788968320. Its totient is φ = 5777176900176.

The previous prime is 10110110100071. The next prime is 10110110100137. The reversal of 10110110100111 is 11100101101101.

10110110100111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 10110110100111 - 2¹³ = 10110110091919 is a prime.

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 = 10110110100093 and 10110110100102.

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23933416 + ... + 24352178.

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

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

10110110100111 is a deficient number, since it is larger than the sum of its proper divisors (6579678868209).

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

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

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

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

Adding to 10110110100111 its reverse (11100101101101), we get a palindrome (21210211201212).

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