The number 582
582 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 97. Divisors (8): 1, 2, 3, 6, 97, 194, 291, 582.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
582 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
582 is composite. Its prime factorisation is
- 3
The divisors add up to 1176; without 582 itself that is 594, so 582 is abundant (594 is more than 582). Euler's totient φ(582) = 192 numbers up to 582 share no factor with it.
- 4
The digits of 582 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 582 = 2 \times 3 \times 97 \]
582 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1176 |
| Euler totient φ(n) | 192 |
| Square | 338724 |
| Cube | 197137368 |
| Square root | 24.124676 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 118 |
| Scientific notation | 5.82 × |
582 in other forms
| Form | Value |
|---|---|
| In words | five hundred and eighty-two |
| Roman numerals | DLXXXII |
| Binary (base 2) | 1001000110 |
| Octal (base 8) | 1106 |
| Hexadecimal (base 16) | 246 |
| Base 3 | 210120 |
| As time | 582 seconds = 9 min 42 s |
Is 582 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (582 ÷ 2 = 291) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (582 ÷ 3 = 194) | 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 (582 ÷ 6 = 97) | 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 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 10) | 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 582 a prime number?
No. 582 = 2 × 3 × 97, so it is divisible by 2.
What are the factors of 582?
1, 2, 3, 6, 97, 194, 291, 582.
What is 582 in binary?
1001000110 (hexadecimal 246, octal 1106).
What is the square root of 582?
About 24.1247.
What is 582 in Roman numerals?
DLXXXII.
Is 582 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 582?
It is a composite number with 8 divisors.