11089149952 has 68 divisors (see below), whose sum is σ = 22724565696. Its totient is φ = 5408030720.

The previous prime is 11089149947. The next prime is 11089149959. The reversal of 11089149952 is 25994198011.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11089149959) by changing a digit.

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 3 ways as a sum of consecutive naturals, for example, 2684913 + ... + 2689039.

Almost surely, 2^11089149952 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 11089149952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11362282848).

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

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

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

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

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

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

The spelling of 11089149952 in words is "eleven billion, eighty-nine million, one hundred forty-nine thousand, nine hundred fifty-two".