111200010208 has 96 divisors (see below), whose sum is σ = 256852076544. Its totient is φ = 46400643072.

The previous prime is 111200010191. The next prime is 111200010209. The reversal of 111200010208 is 802010002111.

111200010208 is digitally balanced in base 3, 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 (16).

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

It is a congruent number.

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

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 15 ways as a sum of consecutive naturals, for example, 2004541 + ... + 2059267.

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

Almost surely, 2^111200010208 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 32, while the sum is 16.

Adding to 111200010208 its reverse (802010002111), we get a palindrome (913210012319).

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