20002101111 has 12 divisors (see below), whose sum is σ = 30591448992. Its totient is φ = 12550337856.

The previous prime is 20002101107. The next prime is 20002101113. The reversal of 20002101111 is 11110120002.

It is a happy number.

It is not a de Polignac number, because 20002101111 - 2² = 20002101107 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 = 20002101093 and 20002101102.

It is a congruent number.

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

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

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

Almost surely, 2^20002101111 is an apocalyptic number.

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

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

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

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

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

Adding to 20002101111 its reverse (11110120002), we get a palindrome (31112221113).

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