2000101111 has 2 divisors, whose sum is σ = 2000101112. Its totient is φ = 2000101110.

The previous prime is 2000101099. The next prime is 2000101157. The reversal of 2000101111 is 1111010002.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 2000101111 - 2⁵ = 2000101079 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (2000101171) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000050555 + 1000050556.

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

Almost surely, 2^2000101111 is an apocalyptic number.

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

2000101111 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The square root of 2000101111 is about 44722.4899910548. The cubic root of 2000101111 is about 1259.9422815166.

Adding to 2000101111 its reverse (1111010002), we get a palindrome (3111111113).

The spelling of 2000101111 in words is "two billion, one hundred one thousand, one hundred eleven".