5011556005032 has 128 divisors (see below), whose sum is σ = 13352094412800. Its totient is φ = 1563024460032.

The previous prime is 5011556005031. The next prime is 5011556005063. The reversal of 5011556005032 is 2305006551105.

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

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

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

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

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

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

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

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

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

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

The spelling of 5011556005032 in words is "five trillion, eleven billion, five hundred fifty-six million, five thousand, thirty-two".