Base | Representation |
---|---|
bin | 1100000111001… |
… | …1111000001000 |
3 | 10112121020010002 |
4 | 3001303320020 |
5 | 101001300110 |
6 | 5012542132 |
7 | 1154563160 |
oct | 301637010 |
9 | 115536102 |
10 | 50806280 |
11 | 26751568 |
12 | 15021948 |
13 | a6ab3b5 |
14 | 6a675a0 |
15 | 46d8aa5 |
hex | 3073e08 |
50806280 has 64 divisors (see below), whose sum is σ = 131258880. Its totient is φ = 17337600.
The previous prime is 50806279. The next prime is 50806297. The reversal of 50806280 is 8260805.
50806280 = 1052 + 1062 + ... + 5352.
It is a happy number.
It is a hoax number, since the sum of its digits (29) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 117665 + ... + 118095.
It is an arithmetic number, because the mean of its divisors is an integer number (2050920).
Almost surely, 250806280 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 50806280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65629440).
50806280 is an abundant number, since it is smaller than the sum of its proper divisors (80452600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50806280 is a wasteful number, since it uses less digits than its factorization.
50806280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 870 (or 866 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 29.
The square root of 50806280 is about 7127.8524114911. The cubic root of 50806280 is about 370.3728406304.
The spelling of 50806280 in words is "fifty million, eight hundred six thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •