The number 8961
8961 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 103. Divisors (8): 1, 3, 29, 87, 103, 309, 2987, 8961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
8961 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
8961 is composite. Its prime factorisation is
- 3
The divisors add up to 12480; without 8961 itself that is 3519, so 8961 is deficient (3519 is less than 8961). Euler's totient φ(8961) = 5712 numbers up to 8961 share no factor with it.
- 4
The digits of 8961 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8961 = 3 \times 29 \times 103 \]
8961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 12480 |
| Euler totient φ(n) | 5712 |
| Square | 80299521 |
| Cube | 719564007681 |
| Square root | 94.662559 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 47 |
| Scientific notation | 8.961 × |
8961 in other forms
| Form | Value |
|---|---|
| In words | eight thousand nine hundred and sixty-one |
| Binary (base 2) | 10001100000001 |
| Octal (base 8) | 21401 |
| Hexadecimal (base 16) | 2301 |
| Base 3 | 110021220 |
| As time | 8961 seconds = 2 h 29 min 21 s |
Is 8961 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 (8961 ÷ 3 = 2987) | 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 | 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 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 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8961 a prime number?
No. 8961 = 3 × 29 × 103, so it is divisible by 3.
What are the factors of 8961?
1, 3, 29, 87, 103, 309, 2987, 8961.
What is 8961 in binary?
10001100000001 (hexadecimal 2301, octal 21401).
What is the square root of 8961?
About 94.6626.
Is 8961 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 8961?
It is a composite number with 8 divisors.