The number 56082
56082 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 13 × 719. Divisors (16): 1, 2, 3, 6, 13, 26, 39, 78, 719, 1438, 2157, 4314, 9347, 18694, 28041, 56082.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56082: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
56082 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 56082 itself that is 64878, so 56082 is abundant (64878 is more than 56082). Euler's totient φ(56082) = 17232 numbers up to 56082 share no factor with it.
- 4
The digits of 56082 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56082 = 2 \times 3 \times 13 \times 719 \]
56082 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 17232 |
| Square | 3145190724 |
| Cube | 176388586183368 |
| Square root | 236.816385 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6082 × |
56082 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and eighty-two |
| Binary (base 2) | 1101101100010010 |
| Octal (base 8) | 155422 |
| Hexadecimal (base 16) | DB12 |
| Base 3 | 2211221010 |
| As time | 56082 seconds = 15 h 34 min 42 s |
Is 56082 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56082 ÷ 2 = 28041) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56082 ÷ 3 = 18694) | 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 (56082 ÷ 6 = 9347) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | 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 4) | 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 56082 a prime number?
No. 56082 = 2 × 3 × 13 × 719, so it is divisible by 2.
What are the factors of 56082?
1, 2, 3, 6, 13, 26, 39, 78, 719, 1438, 2157, 4314, 9347, 18694, 28041, 56082.
What is 56082 in binary?
1101101100010010 (hexadecimal DB12, octal 155422).
What is the square root of 56082?
About 236.8164.
Is 56082 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 56082?
56082 is a happy number: repeatedly adding the squares of its digits reaches 1.