Base | Representation |
---|---|
bin | 101111000010000011… |
… | …111000111100000000 |
3 | 11211100110111010222120 |
4 | 233002003320330000 |
5 | 1311411103033213 |
6 | 35111035404240 |
7 | 3435306440640 |
oct | 570203707400 |
9 | 154313433876 |
10 | 50500439808 |
11 | 1a4651aa975 |
12 | 99545b3680 |
13 | 49ba64a060 |
14 | 2630d9c520 |
15 | 14a8798423 |
hex | bc20f8f00 |
50500439808 has 576 divisors, whose sum is σ = 175047505920. Its totient is φ = 12560891904.
The previous prime is 50500439807. The next prime is 50500439879. The reversal of 50500439808 is 80893400505.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 50500439808.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50500439807) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 143060560 + ... + 143060912.
It is an arithmetic number, because the mean of its divisors is an integer number (303901920).
Almost surely, 250500439808 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 50500439808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87523752960).
50500439808 is an abundant number, since it is smaller than the sum of its proper divisors (124547066112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50500439808 is a wasteful number, since it uses less digits than its factorization.
50500439808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504 (or 490 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 42.
The spelling of 50500439808 in words is "fifty billion, five hundred million, four hundred thirty-nine thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •