11021111010 has 384 divisors, whose sum is σ = 36914282496. Its totient is φ = 2218959360.

The previous prime is 11021111009. The next prime is 11021111021. The reversal of 11021111010 is 1011112011.

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 = 11021110983 and 11021111001.

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 21072609 + ... + 21073131.

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

Almost surely, 2^11021111010 is an apocalyptic number.

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

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

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

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

11021111010 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 11021111010 its reverse (1011112011), we get a palindrome (12032223021).

The spelling of 11021111010 in words is "eleven billion, twenty-one million, one hundred eleven thousand, ten".