1000201011111 has 10 divisors (see below), whose sum is σ = 1494127436472. Its totient is φ = 666800674020.

The previous prime is 1000201011011. The next prime is 1000201011113. The reversal of 1000201011111 is 1111101020001.

1000201011111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a de Polignac number, because none of the positive numbers 2^k-1000201011111 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 = 1000201011093 and 1000201011102.

It is a congruent number.

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

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6174080235 + ... + 6174080396.

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

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

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

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

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

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

Adding to 1000201011111 its reverse (1111101020001), we get a palindrome (2111302031112).

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