The number 64565
64565 is a composite number with 8 divisors. Its prime factorisation is 5 × 37 × 349. Divisors (8): 1, 5, 37, 185, 349, 1745, 12913, 64565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64565 is composite. Its prime factorisation is
- 3
The divisors add up to 79800; without 64565 itself that is 15235, so 64565 is deficient (15235 is less than 64565). Euler's totient φ(64565) = 50112 numbers up to 64565 share no factor with it.
- 4
The digits of 64565 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64565 = 5 \times 37 \times 349 \]
64565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79800 |
| Euler totient φ(n) | 50112 |
| Square | 4168639225 |
| Cube | 269148191562125 |
| Square root | 254.096438 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 73 |
| Scientific notation | 6.4565 × |
64565 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand five hundred and sixty-five |
| Binary (base 2) | 1111110000110101 |
| Octal (base 8) | 176065 |
| Hexadecimal (base 16) | FC35 |
| Base 3 | 10021120022 |
| As time | 64565 seconds = 17 h 56 min 5 s |
Is 64565 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64565 ÷ 5 = 12913) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64565 a prime number?
No. 64565 = 5 × 37 × 349, so it is divisible by 5.
What are the factors of 64565?
1, 5, 37, 185, 349, 1745, 12913, 64565.
What is 64565 in binary?
1111110000110101 (hexadecimal FC35, octal 176065).
What is the square root of 64565?
About 254.0964.
Is 64565 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 64565?
It is a composite number with 8 divisors.