10002000111111 has 12 divisors (see below), whose sum is σ = 14488968465192. Its totient is φ = 6648783933456.

The previous prime is 10002000111091. The next prime is 10002000111119. The reversal of 10002000111111 is 11111100020001.

It is not a de Polignac number, because 10002000111111 - 2¹⁰ = 10002000110087 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 = 10002000111093 and 10002000111102.

It is a congruent number.

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

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

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

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

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

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

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

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

Adding to 10002000111111 its reverse (11111100020001), we get a palindrome (21113100131112).

It can be divided in two parts, 100020001 and 11111, that multiplied together give a palindrome (1111322231111).

The spelling of 10002000111111 in words is "ten trillion, two billion, one hundred eleven thousand, one hundred eleven".