The number 56982
56982 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 9497. Divisors (8): 1, 2, 3, 6, 9497, 18994, 28491, 56982.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56982 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56982 is composite. Its prime factorisation is
- 3
The divisors add up to 113976; without 56982 itself that is 56994, so 56982 is abundant (56994 is more than 56982). Euler's totient φ(56982) = 18992 numbers up to 56982 share no factor with it.
- 4
The digits of 56982 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56982 = 2 \times 3 \times 9497 \]
56982 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 113976 |
| Euler totient φ(n) | 18992 |
| Square | 3246948324 |
| Cube | 185017609398168 |
| Square root | 238.709028 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.6982 × |
56982 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and eighty-two |
| Binary (base 2) | 1101111010010110 |
| Octal (base 8) | 157226 |
| Hexadecimal (base 16) | DE96 |
| Base 3 | 2220011110 |
| As time | 56982 seconds = 15 h 49 min 42 s |
Is 56982 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56982 ÷ 2 = 28491) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56982 ÷ 3 = 18994) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56982 ÷ 6 = 9497) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56982 a prime number?
No. 56982 = 2 × 3 × 9497, so it is divisible by 2.
What are the factors of 56982?
1, 2, 3, 6, 9497, 18994, 28491, 56982.
What is 56982 in binary?
1101111010010110 (hexadecimal DE96, octal 157226).
What is the square root of 56982?
About 238.7090.
Is 56982 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 56982?
It is a composite number with 8 divisors.