200001000012111 has 32 divisors (see below), whose sum is σ = 305861603850240. Its totient is φ = 129030442344000.

The previous prime is 200001000012067. The next prime is 200001000012199. The reversal of 200001000012111 is 111210000100002.

It is a happy number.

It is not a de Polignac number, because 200001000012111 - 2⁹ = 200001000011599 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 = 200001000012093 and 200001000012102.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (200001000012311) 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 31 ways as a sum of consecutive naturals, for example, 42151611 + ... + 46655763.

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

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

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

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

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

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

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

Adding to 200001000012111 its reverse (111210000100002), we get a palindrome (311211000112113).

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