11011001110200 has 2304 divisors, whose sum is σ = 48804076339200. Its totient is φ = 2162449612800.

The previous prime is 11011001110189. The next prime is 11011001110243. The reversal of 11011001110200 is 201110011011.

11011001110200 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 super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 575 ways as a sum of consecutive naturals, for example, 19351495516 + ... + 19351496084.

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

Almost surely, 2^{11011001110200} is an apocalyptic number.

11011001110200 is a gapful number since it is divisible by the number (10) 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 11011001110200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24402038169600).

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

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

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

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

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

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

Adding to 11011001110200 its reverse (201110011011), we get a palindrome (11212111121211).

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