11020002210 has 160 divisors (see below), whose sum is σ = 34504538112. Its totient is φ = 2471264640.

The previous prime is 11020002209. The next prime is 11020002247. The reversal of 11020002210 is 1220002011.

11020002210 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 Curzon number.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 282175 + ... + 318845.

Almost surely, 2^11020002210 is an apocalyptic number.

11020002210 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 11020002210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17252269056).

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

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

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

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

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

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

Adding to 11020002210 its reverse (1220002011), we get a palindrome (12240004221).

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