1000002111111 has 36 divisors (see below), whose sum is σ = 1510354263600. Its totient is φ = 637524490944.

The previous prime is 1000002111089. The next prime is 1000002111221. The reversal of 1000002111111 is 1111112000001.

It is not a de Polignac number, because 1000002111111 - 2¹⁰ = 1000002110087 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 = 1000002111093 and 1000002111102.

It is a congruent number.

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

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

It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 20967430 + ... + 21015068.

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

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

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

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

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

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

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

Adding to 1000002111111 its reverse (1111112000001), we get a palindrome (2111114111112).

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