111010200210 has 216 divisors, whose sum is σ = 363565203300. Its totient is φ = 23421775104.

The previous prime is 111010200181. The next prime is 111010200211. The reversal of 111010200210 is 12002010111.

It is a happy number.

It can be written as a sum of positive squares in 6 ways, for example, as 32684662521 + 78325537689 = 180789^2 + 279867^2 .

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 = 111010200192 and 111010200201.

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

Almost surely, 2^111010200210 is an apocalyptic number.

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

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

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

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

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

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

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

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

Adding to 111010200210 its reverse (12002010111), we get a palindrome (123012210321).

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