201110200200 has 864 divisors, whose sum is σ = 865988323200. Its totient is φ = 41435089920.

The previous prime is 201110200169. The next prime is 201110200211. The reversal of 201110200200 is 2002011102.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is an unprimeable number.

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

It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 49301761 + ... + 49305839.

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

Almost surely, 2^201110200200 is an apocalyptic number.

201110200200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 201110200200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (432994161600).

201110200200 is an abundant number, since it is smaller than the sum of its proper divisors (664878123000).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 201110200200 its reverse (2002011102), we get a palindrome (203112211302).

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