200010111111 has 24 divisors (see below), whose sum is σ = 301614440400. Its totient is φ = 132445150272.

The previous prime is 200010111109. The next prime is 200010111121. The reversal of 200010111111 is 111111010002.

It is not a de Polignac number, because 200010111111 - 2¹ = 200010111109 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 = 200010111093 and 200010111102.

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2725830 + ... + 2798243.

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

Almost surely, 2^200010111111 is an apocalyptic number.

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

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

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

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

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

Adding to 200010111111 its reverse (111111010002), we get a palindrome (311121121113).

The spelling of 200010111111 in words is "two hundred billion, ten million, one hundred eleven thousand, one hundred eleven".