110200002111 has 12 divisors (see below), whose sum is σ = 159394949688. Its totient is φ = 73366436304.

The previous prime is 110200002079. The next prime is 110200002113. The reversal of 110200002111 is 111200002011.

It is a happy number.

It is not a de Polignac number, because 110200002111 - 2⁵ = 110200002079 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 = 110200002093 and 110200002102.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8345685 + ... + 8358878.

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

Almost surely, 2^110200002111 is an apocalyptic number.

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

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

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

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

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

Adding to 110200002111 its reverse (111200002011), we get a palindrome (221400004122).

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