20000100111111 has 6 divisors (see below), whose sum is σ = 28889033493840. Its totient is φ = 13333400074068.

The previous prime is 20000100111097. The next prime is 20000100111137. The reversal of 20000100111111 is 11111100100002.

It is not a de Polignac number, because 20000100111111 - 2⁷ = 20000100110983 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 2222233345679 = 20000100111111 / (2 + 0 + 0 + 0 + 0 + 1 + 0 + 0 + 1 + 1 + 1 + 1 + 1 + 1).

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

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1111116672831 + ... + 1111116672848.

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

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

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

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

20000100111111 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 20000100111111 its reverse (11111100100002), we get a palindrome (31111200211113).

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