Search a number
-
+
50623209000 = 233253713113547
BaseRepresentation
bin101111001001011000…
…001101111000101000
311211200000111110122200
4233021120031320220
51312134020142000
635131143020200
73441330114420
oct571130157050
9154600443580
1050623209000
111a518533211
12998973a660
134a09c03550
1426433d9480
1514b4449500
hexbc960de28

50623209000 has 768 divisors, whose sum is σ = 212844602880. Its totient is φ = 10567065600.

The previous prime is 50623208981. The next prime is 50623209067. The reversal of 50623209000 is 90232605.

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 191 ways as a sum of consecutive naturals, for example, 92546727 + ... + 92547273.

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

Almost surely, 250623209000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 27.

The spelling of 50623209000 in words is "fifty billion, six hundred twenty-three million, two hundred nine thousand".