Search a number
-
+
50336391072 = 253112127149229
BaseRepresentation
bin101110111000010010…
…000101111110100000
311210221000210121102110
4232320102011332200
51311042104003242
635042455315320
73431245156512
oct567022057640
9153830717373
1050336391072
111a390642700
12990967bb40
13499266c7b6
142617297bb2
15149919139c
hexbb8485fa0

50336391072 has 288 divisors, whose sum is σ = 148006656000. Its totient is φ = 14966138880.

The previous prime is 50336391071. The next prime is 50336391109. The reversal of 50336391072 is 27019363305.

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

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

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

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

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

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

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

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

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

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

The spelling of 50336391072 in words is "fifty billion, three hundred thirty-six million, three hundred ninety-one thousand, seventy-two".