Search a number
-
+
50060520000 = 263254241577
BaseRepresentation
bin101110100111110101…
…101110101001000000
311210012210200220110100
4232213311232221000
51310010443120000
634555242402400
73421355253621
oct564765565100
9153183626410
1050060520000
111a259949687
129851200400
13494a46c58a
1425cc7a5a48
15147ed4ba00
hexba7d6ea40

50060520000 has 420 divisors, whose sum is σ = 180360450556. Its totient is φ = 13271040000.

The previous prime is 50060519941. The next prime is 50060520049. The reversal of 50060520000 is 2506005.

It can be written as a sum of positive squares in 10 ways, for example, as 15312577536 + 34747942464 = 123744^2 + 186408^2 .

It is a Harshad number since it is a multiple of its sum of digits (18).

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 59 ways as a sum of consecutive naturals, for example, 86759712 + ... + 86760288.

Almost surely, 250060520000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 50060520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90180225278).

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

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

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

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

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

The product of its (nonzero) digits is 300, while the sum is 18.

The spelling of 50060520000 in words is "fifty billion, sixty million, five hundred twenty thousand".