201000020111111 has 4 divisors (see below), whose sum is σ = 216461560119672. Its totient is φ = 185538480102552.

The previous prime is 201000020111069. The next prime is 201000020111129. The reversal of 201000020111111 is 111111020000102.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-201000020111111 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7730770004261 + ... + 7730770004286.

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

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

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

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

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

The sum of its prime factors is 15461540008560.

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 201000020111111 its reverse (111111020000102), we get a palindrome (312111040111213).

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