11100211032 has 64 divisors (see below), whose sum is σ = 28309824000. Its totient is φ = 3625674624.

The previous prime is 11100211009. The next prime is 11100211039. The reversal of 11100211032 is 23011200111.

It is a Harshad number since it is a multiple of its sum of digits (12).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11100211039) 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, 1087569 + ... + 1097727.

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

Almost surely, 2^11100211032 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

Adding to 11100211032 its reverse (23011200111), we get a palindrome (34111411143).

The spelling of 11100211032 in words is "eleven billion, one hundred million, two hundred eleven thousand, thirty-two".