11151920640000 has 1040 divisors, whose sum is σ = 42672917695232. Its totient is φ = 2536538112000.

The previous prime is 11151920639983. The next prime is 11151920640011. The reversal of 11151920640000 is 4602915111.

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

It is a self number, because there is not a number n which added to its sum of digits gives 11151920640000.

It is an unprimeable number.

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

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

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

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

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

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

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

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

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

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

The spelling of 11151920640000 in words is "eleven trillion, one hundred fifty-one billion, nine hundred twenty million, six hundred forty thousand".