The number 56961
56961 is a composite number with 6 divisors. Its prime factorisation is × 6329. Divisors (6): 1, 3, 9, 6329, 18987, 56961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56961 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56961 is composite. Its prime factorisation is
- 3
The divisors add up to 82290; without 56961 itself that is 25329, so 56961 is deficient (25329 is less than 56961). Euler's totient φ(56961) = 37968 numbers up to 56961 share no factor with it.
- 4
The digits of 56961 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56961 = 3^{2} \times 6329 \]56961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 82290 |
| Euler totient φ(n) | 37968 |
| Square | 3244555521 |
| Cube | 184813127031681 |
| Square root | 238.665037 (= 3√6329) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.6961 × |
56961 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and sixty-one |
| Binary (base 2) | 1101111010000001 |
| Octal (base 8) | 157201 |
| Hexadecimal (base 16) | DE81 |
| Base 3 | 2220010200 |
| As time | 56961 seconds = 15 h 49 min 21 s |
Is 56961 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 (56961 ÷ 3 = 18987) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (56961 ÷ 9 = 6329) | 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 3) | 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 56961 a prime number?
No. 56961 = × 6329, so it is divisible by 3.
What are the factors of 56961?
1, 3, 9, 6329, 18987, 56961.
What is 56961 in binary?
1101111010000001 (hexadecimal DE81, octal 157201).
What is the square root of 56961?
About 238.6650, exactly 3√6329.
Is 56961 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56961?
It is a composite number with 6 divisors.