2000011020111 has 12 divisors (see below), whose sum is σ = 3111128253688. Its totient is φ = 1230776012304.

The previous prime is 2000011020103. The next prime is 2000011020113. The reversal of 2000011020111 is 1110201100002.

It is a happy number.

It is not a de Polignac number, because 2000011020111 - 2³ = 2000011020103 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 = 2000011020093 and 2000011020102.

It is a congruent number.

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

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

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

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

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

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

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

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

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

Adding to 2000011020111 its reverse (1110201100002), we get a palindrome (3110212120113).

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