Base | Representation |
---|---|
bin | 1111010110000… |
… | …0010100110000 |
3 | 11111002201010210 |
4 | 3311200110300 |
5 | 112433421210 |
6 | 10215224120 |
7 | 1411013502 |
oct | 365402460 |
9 | 144081123 |
10 | 64357680 |
11 | 33367972 |
12 | 19678040 |
13 | 1044458a |
14 | 8793d72 |
15 | 59b3e20 |
hex | 3d60530 |
64357680 has 160 divisors (see below), whose sum is σ = 212129280. Its totient is φ = 16107520.
The previous prime is 64357679. The next prime is 64357687. The reversal of 64357680 is 8675346.
It is not an unprimeable number, because it can be changed into a prime (64357687) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 491215 + ... + 491345.
It is an arithmetic number, because the mean of its divisors is an integer number (1325808).
Almost surely, 264357680 is an apocalyptic number.
64357680 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64357680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106064640).
64357680 is an abundant number, since it is smaller than the sum of its proper divisors (147771600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64357680 is a wasteful number, since it uses less digits than its factorization.
64357680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259 (or 253 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 39.
The square root of 64357680 is about 8022.3238528496. The cubic root of 64357680 is about 400.7437827774.
The spelling of 64357680 in words is "sixty-four million, three hundred fifty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •