Base | Representation |
---|---|
bin | 1100001010100… |
… | …0010010000000 |
3 | 10120000010120000 |
4 | 3002220102000 |
5 | 101030132203 |
6 | 5021320000 |
7 | 1156446030 |
oct | 302502200 |
9 | 116003500 |
10 | 51020928 |
11 | 26888862 |
12 | 15106000 |
13 | a754cca |
14 | 6ac18c0 |
15 | 472c4a3 |
hex | 30a8480 |
51020928 has 320 divisors, whose sum is σ = 187598400. Its totient is φ = 13436928.
The previous prime is 51020887. The next prime is 51020929. The reversal of 51020928 is 82902015.
51020928 is nontrivially palindromic in base 11.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (51020929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1378926 + ... + 1378962.
It is an arithmetic number, because the mean of its divisors is an integer number (586245).
Almost surely, 251020928 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 51020928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93799200).
51020928 is an abundant number, since it is smaller than the sum of its proper divisors (136577472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51020928 is a wasteful number, since it uses less digits than its factorization.
51020928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89 (or 68 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 51020928 is about 7142.8935313359. The cubic root of 51020928 is about 370.8936954918.
The spelling of 51020928 in words is "fifty-one million, twenty thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •