The number 58082
58082 is a composite number with 8 divisors. Its prime factorisation is 2 × 113 × 257. Divisors (8): 1, 2, 113, 226, 257, 514, 29041, 58082.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
58082 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
58082 is composite. Its prime factorisation is
- 3
The divisors add up to 88236; without 58082 itself that is 30154, so 58082 is deficient (30154 is less than 58082). Euler's totient φ(58082) = 28672 numbers up to 58082 share no factor with it.
- 4
The digits of 58082 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58082 = 2 \times 113 \times 257 \]
58082 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88236 |
| Euler totient φ(n) | 28672 |
| Square | 3373518724 |
| Cube | 195940714527368 |
| Square root | 241.002075 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.8082 × |
58082 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and eighty-two |
| Binary (base 2) | 1110001011100010 |
| Octal (base 8) | 161342 |
| Hexadecimal (base 16) | E2E2 |
| Base 3 | 2221200012 |
| As time | 58082 seconds = 16 h 8 min 2 s |
Is 58082 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58082 ÷ 2 = 29041) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58082 a prime number?
No. 58082 = 2 × 113 × 257, so it is divisible by 2.
What are the factors of 58082?
1, 2, 113, 226, 257, 514, 29041, 58082.
What is 58082 in binary?
1110001011100010 (hexadecimal E2E2, octal 161342).
What is the square root of 58082?
About 241.0021.
Is 58082 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 58082?
It is a composite number with 8 divisors.