Base | Representation |
---|---|
bin | 1100000111000… |
… | …1000100110000 |
3 | 10112120122100220 |
4 | 3001301010300 |
5 | 101000413200 |
6 | 5012413040 |
7 | 1154514540 |
oct | 301610460 |
9 | 115518326 |
10 | 50794800 |
11 | 26743981 |
12 | 15017180 |
13 | a6a60c4 |
14 | 6a63320 |
15 | 46d54a0 |
hex | 3071130 |
50794800 has 120 divisors (see below), whose sum is σ = 185988096. Its totient is φ = 11608320.
The previous prime is 50794789. The next prime is 50794801. The reversal of 50794800 is 849705.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×507948002 = 5160223414080000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50794801) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5377 + ... + 11423.
Almost surely, 250794800 is an apocalyptic number.
50794800 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 50794800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92994048).
50794800 is an abundant number, since it is smaller than the sum of its proper divisors (135193296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50794800 is a wasteful number, since it uses less digits than its factorization.
50794800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6075 (or 6064 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
The square root of 50794800 is about 7127.0470743499. The cubic root of 50794800 is about 370.3449425012.
The spelling of 50794800 in words is "fifty million, seven hundred ninety-four thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •