Base | Representation |
---|---|
bin | 1100001110100… |
… | …1001001010000 |
3 | 10120111122000000 |
4 | 3003221021100 |
5 | 101112132413 |
6 | 5031130000 |
7 | 1161633432 |
oct | 303511120 |
9 | 116448000 |
10 | 51286608 |
11 | 26a4a42a |
12 | 15213900 |
13 | a818c09 |
14 | 6b50652 |
15 | 4781073 |
hex | 30e9250 |
51286608 has 70 divisors (see below), whose sum is σ = 149017434. Its totient is φ = 17091648.
The previous prime is 51286607. The next prime is 51286657. The reversal of 51286608 is 80668215.
It is a happy number.
51286608 is a `hidden beast` number, since 512 + 86 + 60 + 8 = 666.
It can be written as a sum of positive squares in only one way, i.e., 43401744 + 7884864 = 6588^2 + 2808^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51286607) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 9466 + ... + 13862.
Almost surely, 251286608 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 51286608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74508717).
51286608 is an abundant number, since it is smaller than the sum of its proper divisors (97730826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51286608 is an equidigital number, since it uses as much as digits as its factorization.
51286608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4423 (or 4402 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 51286608 is about 7161.4668888434. The cubic root of 51286608 is about 371.5363630796.
The spelling of 51286608 in words is "fifty-one million, two hundred eighty-six thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •