11150520000 has 140 divisors (see below), whose sum is σ = 36866617656. Its totient is φ = 2973440000.

The previous prime is 11150519959. The next prime is 11150520011. The reversal of 11150520000 is 2505111.

11150520000 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 (15).

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 19 ways as a sum of consecutive naturals, for example, 73540 + ... + 166460.

Almost surely, 2^11150520000 is an apocalyptic number.

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

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

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

11150520000 is an frugal number, since it uses more digits than its factorization.

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

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

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

The spelling of 11150520000 in words is "eleven billion, one hundred fifty million, five hundred twenty thousand".