Search a number
-
+
50060555500 = 2253100121111
BaseRepresentation
bin101110100111110101…
…110111010011101100
311210012210202201011011
4232213311313103230
51310011000234000
634555243235004
73421355462254
oct564765672354
9153183681134
1050060555500
111a25997331a
129851218a64
13494a482797
1425cc7b4964
15147ed572ba
hexba7d774ec

50060555500 has 24 divisors (see below), whose sum is σ = 109332254304. Its totient is φ = 20024222000.

The previous prime is 50060555491. The next prime is 50060555521. The reversal of 50060555500 is 555506005.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50060056 + ... + 50061055.

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

Almost surely, 250060555500 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 18750, while the sum is 31.

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

Divisors: 1 2 4 5 10 20 25 50 100 125 250 500 100121111 200242222 400484444 500605555 1001211110 2002422220 2503027775 5006055550 10012111100 12515138875 25030277750 50060555500