10000020111111 has 12 divisors (see below), whose sum is σ = 14478783412600. Its totient is φ = 6650844726960.

The previous prime is 10000020111101. The next prime is 10000020111119. The reversal of 10000020111111 is 11111102000001.

It is not a de Polignac number, because 10000020111111 - 2⁹ = 10000020110599 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10000020111119) 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, 1319608261 + ... + 1319615838.

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

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

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

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

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

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

Adding to 10000020111111 its reverse (11111102000001), we get a palindrome (21111122111112).

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