The number 65391
65391 is a composite number with 8 divisors. Its prime factorisation is 3 × 71 × 307. Divisors (8): 1, 3, 71, 213, 307, 921, 21797, 65391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
65391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
65391 is composite. Its prime factorisation is
- 3
The divisors add up to 88704; without 65391 itself that is 23313, so 65391 is deficient (23313 is less than 65391). Euler's totient φ(65391) = 42840 numbers up to 65391 share no factor with it.
- 4
The digits of 65391 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65391 = 3 \times 71 \times 307 \]
65391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88704 |
| Euler totient φ(n) | 42840 |
| Square | 4275982881 |
| Cube | 279610796571471 |
| Square root | 255.716640 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 161 |
| Scientific notation | 6.5391 × |
65391 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand three hundred and ninety-one |
| Binary (base 2) | 1111111101101111 |
| Octal (base 8) | 177557 |
| Hexadecimal (base 16) | FF6F |
| Base 3 | 10022200220 |
| As time | 65391 seconds = 18 h 9 min 51 s |
Is 65391 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 (65391 ÷ 3 = 21797) | 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 | No (remainder 1) | 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 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 7) | 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 | No (remainder 1) | 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 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65391 a prime number?
No. 65391 = 3 × 71 × 307, so it is divisible by 3.
What are the factors of 65391?
1, 3, 71, 213, 307, 921, 21797, 65391.
What is 65391 in binary?
1111111101101111 (hexadecimal FF6F, octal 177557).
What is the square root of 65391?
About 255.7166.
Is 65391 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 65391?
It is a composite number with 8 divisors.