The number 64500
64500 is a composite number with 48 divisors. Its prime factorisation is × 3 × × 43. Divisors (48): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 43, 50, 60, 75 … 64500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64500: a Harshad number: divisible by its digit sum 15.
- 2
64500 is composite. Its prime factorisation is
- 3
The divisors add up to 192192; without 64500 itself that is 127692, so 64500 is abundant (127692 is more than 64500). Euler's totient φ(64500) = 16800 numbers up to 64500 share no factor with it.
- 4
The digits of 64500 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64500 = 2^{2} \times 3 \times 5^{3} \times 43 \]64500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 192192 |
| Euler totient φ(n) | 16800 |
| Square | 4160250000 |
| Cube | 268336125000000 |
| Square root | 253.968502 (= 10√645) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.45 × |
64500 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand five hundred |
| Binary (base 2) | 1111101111110100 |
| Octal (base 8) | 175764 |
| Hexadecimal (base 16) | FBF4 |
| Base 3 | 10021110220 |
| As time | 64500 seconds = 17 h 55 min 0 s |
Is 64500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64500 ÷ 2 = 32250) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64500 ÷ 3 = 21500) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64500 ÷ 4 = 16125) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64500 ÷ 5 = 12900) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (64500 ÷ 6 = 10750) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (64500 ÷ 10 = 6450) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (64500 ÷ 12 = 5375) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64500 a prime number?
No. 64500 = × 3 × × 43, so it is divisible by 2.
What are the factors of 64500?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 25, 30, 43, 50, 60, 75, 86, 100, 125, 129, 150, 172, 215, 250, 258, 300, 375, 430, 500, 516, 645, 750, 860, 1075, 1290, 1500, 2150, 2580, 3225, 4300, 5375, 6450, 10750, 12900, 16125, 21500, 32250, 64500.
What is 64500 in binary?
1111101111110100 (hexadecimal FBF4, octal 175764).
What is the square root of 64500?
About 253.9685, exactly 10√645.
Is 64500 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 64500?
64500 is a Harshad number: divisible by its digit sum 15.