Base | Representation |
---|---|
bin | 1111011000110… |
… | …1000010000000 |
3 | 11111110000100000 |
4 | 3312031002000 |
5 | 113010301200 |
6 | 10223200000 |
7 | 1412405412 |
oct | 366150200 |
9 | 144400300 |
10 | 64540800 |
11 | 33482505 |
12 | 19746000 |
13 | 104a9a2c |
14 | 88009b2 |
15 | 59ed300 |
hex | 3d8d080 |
64540800 has 288 divisors, whose sum is σ = 241703280. Its totient is φ = 17003520.
The previous prime is 64540787. The next prime is 64540813. The reversal of 64540800 is 804546.
It is an interprime number because it is at equal distance from previous prime (64540787) and next prime (64540813).
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 777559 + ... + 777641.
Almost surely, 264540800 is an apocalyptic number.
64540800 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 64540800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120851640).
64540800 is an abundant number, since it is smaller than the sum of its proper divisors (177162480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64540800 is an equidigital number, since it uses as much as digits as its factorization.
64540800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122 (or 93 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 64540800 is about 8033.7288975917. The cubic root of 64540800 is about 401.1235080364.
The spelling of 64540800 in words is "sixty-four million, five hundred forty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •