20002111110 has 96 divisors (see below), whose sum is σ = 56294304480. Its totient is φ = 5053140288.

The previous prime is 20002111099. The next prime is 20002111117. The reversal of 20002111110 is 1111120002.

It is a happy number.

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 = 20002111092 and 20002111101.

It is a congruent number.

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

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

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

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

Almost surely, 2^20002111110 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 20002111110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28147152240).

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

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

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

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

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

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

Adding to 20002111110 its reverse (1111120002), we get a palindrome (21113231112).

The spelling of 20002111110 in words is "twenty billion, two million, one hundred eleven thousand, one hundred ten".