The number 56382
56382 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 9397. Divisors (8): 1, 2, 3, 6, 9397, 18794, 28191, 56382.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56382 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56382 is composite. Its prime factorisation is
- 3
The divisors add up to 112776; without 56382 itself that is 56394, so 56382 is abundant (56394 is more than 56382). Euler's totient φ(56382) = 18792 numbers up to 56382 share no factor with it.
- 4
The digits of 56382 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 228 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56382 = 2 \times 3 \times 9397 \]
56382 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 112776 |
| Euler totient φ(n) | 18792 |
| Square | 3178929924 |
| Cube | 179234426974968 |
| Square root | 237.448942 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 228 |
| Scientific notation | 5.6382 × |
56382 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand three hundred and eighty-two |
| Binary (base 2) | 1101110000111110 |
| Octal (base 8) | 156076 |
| Hexadecimal (base 16) | DC3E |
| Base 3 | 2212100020 |
| As time | 56382 seconds = 15 h 39 min 42 s |
Is 56382 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56382 ÷ 2 = 28191) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56382 ÷ 3 = 18794) | 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 (56382 ÷ 6 = 9397) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 7) | 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 56382 a prime number?
No. 56382 = 2 × 3 × 9397, so it is divisible by 2.
What are the factors of 56382?
1, 2, 3, 6, 9397, 18794, 28191, 56382.
What is 56382 in binary?
1101110000111110 (hexadecimal DC3E, octal 156076).
What is the square root of 56382?
About 237.4489.
Is 56382 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 56382?
It is a composite number with 8 divisors.