50560406232 has 128 divisors (see below), whose sum is σ = 145270026240. Its totient is φ = 14364915840.

The previous prime is 50560406203. The next prime is 50560406249. The reversal of 50560406232 is 23260406505.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27080163 + ... + 27082029.

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

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

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

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

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

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

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

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

The spelling of 50560406232 in words is "fifty billion, five hundred sixty million, four hundred six thousand, two hundred thirty-two".