Base | Representation |
---|---|
bin | 1111101001010… |
… | …1110111011000 |
3 | 11120111010100022 |
4 | 3322111313120 |
5 | 113300004220 |
6 | 10302330012 |
7 | 1424544110 |
oct | 372256730 |
9 | 146433308 |
10 | 65625560 |
11 | 34053500 |
12 | 19b89908 |
13 | 107996c0 |
14 | 8a04040 |
15 | 5b64925 |
hex | 3e95dd8 |
65625560 has 192 divisors, whose sum is σ = 201096000. Its totient is φ = 18754560.
The previous prime is 65625557. The next prime is 65625643. The reversal of 65625560 is 6552656.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 65625560.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 440366 + ... + 440514.
It is an arithmetic number, because the mean of its divisors is an integer number (1047375).
Almost surely, 265625560 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 65625560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100548000).
65625560 is an abundant number, since it is smaller than the sum of its proper divisors (135470440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65625560 is a wasteful number, since it uses less digits than its factorization.
65625560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202 (or 187 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 35.
The square root of 65625560 is about 8100.9604368865. The cubic root of 65625560 is about 403.3583088299.
65625560 divided by its sum of digits (35) gives a triangular number (1875016 = T1936).
The spelling of 65625560 in words is "sixty-five million, six hundred twenty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •