11501525436 has 72 divisors (see below), whose sum is σ = 28655706240. Its totient is φ = 3580547040.

The previous prime is 11501525411. The next prime is 11501525437. The reversal of 11501525436 is 63452510511.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11501525437) 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 23 ways as a sum of consecutive naturals, for example, 1144345 + ... + 1154351.

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

Almost surely, 2^11501525436 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

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

The spelling of 11501525436 in words is "eleven billion, five hundred one million, five hundred twenty-five thousand, four hundred thirty-six".