10100110101111 has 64 divisors (see below), whose sum is σ = 15604658995200. Its totient is φ = 6448508091648.

The previous prime is 10100110101079. The next prime is 10100110101121. The reversal of 10100110101111 is 11110101100101.

It is not a de Polignac number, because 10100110101111 - 2⁵ = 10100110101079 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 = 10100110101093 and 10100110101102.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 547214595 + ... + 547233051.

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

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

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

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

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

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

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

Adding to 10100110101111 its reverse (11110101100101), we get a palindrome (21210211201212).

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