The number 64395
64395 is a composite number with 24 divisors. Its prime factorisation is × 5 × 53. Divisors (24): 1, 3, 5, 9, 15, 27, 45, 53, 81, 135, 159, 243, 265, 405, 477, 795 … 64395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64395: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
64395 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 64395 itself that is 53541, so 64395 is deficient (53541 is less than 64395). Euler's totient φ(64395) = 33696 numbers up to 64395 share no factor with it.
- 4
The digits of 64395 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64395 = 3^{5} \times 5 \times 53 \]64395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 33696 |
| Square | 4146716025 |
| Cube | 267027778429875 |
| Square root | 253.761699 (= 9√795) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 47 |
| Scientific notation | 6.4395 × |
64395 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand three hundred and ninety-five |
| Binary (base 2) | 1111101110001011 |
| Octal (base 8) | 175613 |
| Hexadecimal (base 16) | FB8B |
| Base 3 | 10021100000 |
| As time | 64395 seconds = 17 h 53 min 15 s |
Is 64395 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 | Yes (64395 ÷ 3 = 21465) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64395 ÷ 5 = 12879) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (64395 ÷ 9 = 7155) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64395 a prime number?
No. 64395 = × 5 × 53, so it is divisible by 3.
What are the factors of 64395?
1, 3, 5, 9, 15, 27, 45, 53, 81, 135, 159, 243, 265, 405, 477, 795, 1215, 1431, 2385, 4293, 7155, 12879, 21465, 64395.
What is 64395 in binary?
1111101110001011 (hexadecimal FB8B, octal 175613).
What is the square root of 64395?
About 253.7617, exactly 9√795.
Is 64395 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 64395?
64395 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.