Base | Representation |
---|---|
bin | 101111000001110111… |
… | …000011100000000000 |
3 | 11211100020011012121110 |
4 | 233001313003200000 |
5 | 1311404222401300 |
6 | 35110435323320 |
7 | 3435236025405 |
oct | 570167034000 |
9 | 154306135543 |
10 | 50497075200 |
11 | 1a463312000 |
12 | 9953450540 |
13 | 49b9a3c770 |
14 | 26307642ac |
15 | 14a8331550 |
hex | bc1dc3800 |
50497075200 has 1152 divisors, whose sum is σ = 208149177600. Its totient is φ = 10705305600.
The previous prime is 50497075193. The next prime is 50497075201. The reversal of 50497075200 is 257079405.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50497075201) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2657740791 + ... + 2657740809.
It is an arithmetic number, because the mean of its divisors is an integer number (180685050).
Almost surely, 250497075200 is an apocalyptic number.
50497075200 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 50497075200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (104074588800).
50497075200 is an abundant number, since it is smaller than the sum of its proper divisors (157652102400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50497075200 is a wasteful number, since it uses less digits than its factorization.
50497075200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100 (or 53 counting only the distinct ones).
The product of its (nonzero) digits is 88200, while the sum is 39.
The spelling of 50497075200 in words is "fifty billion, four hundred ninety-seven million, seventy-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •