The number 9465
9465 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 631. Divisors (8): 1, 3, 5, 15, 631, 1893, 3155, 9465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9465 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9465 is composite. Its prime factorisation is
- 3
The divisors add up to 15168; without 9465 itself that is 5703, so 9465 is deficient (5703 is less than 9465). Euler's totient φ(9465) = 5040 numbers up to 9465 share no factor with it.
- 4
The digits of 9465 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9465 = 3 \times 5 \times 631 \]
9465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15168 |
| Euler totient φ(n) | 5040 |
| Square | 89586225 |
| Cube | 847933619625 |
| Square root | 97.288232 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.465 × |
9465 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and sixty-five |
| Binary (base 2) | 10010011111001 |
| Octal (base 8) | 22371 |
| Hexadecimal (base 16) | 24F9 |
| Base 3 | 110222120 |
| As time | 9465 seconds = 2 h 37 min 45 s |
Is 9465 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 (9465 ÷ 3 = 3155) | 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 (9465 ÷ 5 = 1893) | 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 1) | 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9465 a prime number?
No. 9465 = 3 × 5 × 631, so it is divisible by 3.
What are the factors of 9465?
1, 3, 5, 15, 631, 1893, 3155, 9465.
What is 9465 in binary?
10010011111001 (hexadecimal 24F9, octal 22371).
What is the square root of 9465?
About 97.2882.
Is 9465 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 9465?
It is a composite number with 8 divisors.