11556056550 has 48 divisors (see below), whose sum is σ = 29128863312. Its totient is φ = 3031094400.

The previous prime is 11556056537. The next prime is 11556056573. The reversal of 11556056550 is 5565065511.

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

It is a congruent number.

It is an unprimeable number.

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, 622329 + ... + 640628.

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

Almost surely, 2^11556056550 is an apocalyptic number.

11556056550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

The product of its (nonzero) digits is 112500, while the sum is 39.

The spelling of 11556056550 in words is "eleven billion, five hundred fifty-six million, fifty-six thousand, five hundred fifty".