Base | Representation |
---|---|
bin | 1100001110100… |
… | …0101010000000 |
3 | 10120111112020221 |
4 | 3003220222000 |
5 | 101112101413 |
6 | 5031112424 |
7 | 1161624544 |
oct | 303505200 |
9 | 116445227 |
10 | 51284608 |
11 | 26a48981 |
12 | 15212714 |
13 | a81802b |
14 | 6b4da24 |
15 | 478068d |
hex | 30e8a80 |
51284608 has 32 divisors (see below), whose sum is σ = 102892500. Its totient is φ = 25460736.
The previous prime is 51284603. The next prime is 51284647. The reversal of 51284608 is 80648215.
It can be written as a sum of positive squares in 2 ways, for example, as 38837824 + 12446784 = 6232^2 + 3528^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×512846082 = 5260222035427328, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51284603) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17728 + ... + 20416.
Almost surely, 251284608 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 51284608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51446250).
51284608 is an abundant number, since it is smaller than the sum of its proper divisors (51607892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51284608 is a wasteful number, since it uses less digits than its factorization.
51284608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2852 (or 2840 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 34.
The square root of 51284608 is about 7161.3272512852. The cubic root of 51284608 is about 371.5315334732.
The spelling of 51284608 in words is "fifty-one million, two hundred eighty-four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •