Search a number
-
+
50011604832 = 25371910736607
BaseRepresentation
bin101110100100111011…
…001000011101100000
311210002101122202110110
4232210323020131200
51304410432323312
634550334131320
73420222425040
oct564473103540
9153071582413
1050011604832
111a234279a22
129838950b40
1349402a3ba7
1425c60b1720
15147a8d843c
hexba4ec8760

50011604832 has 192 divisors, whose sum is σ = 159411732480. Its totient is φ = 13410095616.

The previous prime is 50011604809. The next prime is 50011604837. The reversal of 50011604832 is 23840611005.

It is a self number, because there is not a number n which added to its sum of digits gives 50011604832.

It is a congruent number.

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

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, 1347873 + ... + 1384479.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 5760, while the sum is 30.

The spelling of 50011604832 in words is "fifty billion, eleven million, six hundred four thousand, eight hundred thirty-two".