10110113111 has 12 divisors (see below), whose sum is σ = 12140124480. Its totient is φ = 8386267680.

The previous prime is 10110113093. The next prime is 10110113119. The reversal of 10110113111 is 11131101101.

10110113111 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 10110113111 - 2²⁶ = 10043004247 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10110113092 and 10110113101.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3326366 + ... + 3329403.

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

Almost surely, 2^10110113111 is an apocalyptic number.

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

10110113111 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 10110113111 its reverse (11131101101), we get a palindrome (21241214212).

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