The number 9670
9670 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 967. Divisors (8): 1, 2, 5, 10, 967, 1934, 4835, 9670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9670 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9670 is composite. Its prime factorisation is
- 3
The divisors add up to 17424; without 9670 itself that is 7754, so 9670 is deficient (7754 is less than 9670). Euler's totient φ(9670) = 3864 numbers up to 9670 share no factor with it.
- 4
The digits of 9670 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 21 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9670 = 2 \times 5 \times 967 \]
9670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17424 |
| Euler totient φ(n) | 3864 |
| Square | 93508900 |
| Cube | 904231063000 |
| Square root | 98.336158 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 21 |
| Scientific notation | 9.67 × |
9670 in other forms
| Form | Value |
|---|---|
| In words | nine thousand six hundred and seventy |
| Binary (base 2) | 10010111000110 |
| Octal (base 8) | 22706 |
| Hexadecimal (base 16) | 25C6 |
| Base 3 | 111021011 |
| As time | 9670 seconds = 2 h 41 min 10 s |
Is 9670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9670 ÷ 2 = 4835) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (9670 ÷ 5 = 1934) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (9670 ÷ 10 = 967) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9670 a prime number?
No. 9670 = 2 × 5 × 967, so it is divisible by 2.
What are the factors of 9670?
1, 2, 5, 10, 967, 1934, 4835, 9670.
What is 9670 in binary?
10010111000110 (hexadecimal 25C6, octal 22706).
What is the square root of 9670?
About 98.3362.
Is 9670 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 9670?
It is a composite number with 8 divisors.