The number 58330
58330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 19 × 307. Divisors (16): 1, 2, 5, 10, 19, 38, 95, 190, 307, 614, 1535, 3070, 5833, 11666, 29165, 58330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58330: a Harshad number: divisible by its digit sum 19.
- 2
58330 is composite. Its prime factorisation is
- 3
The divisors add up to 110880; without 58330 itself that is 52550, so 58330 is deficient (52550 is less than 58330). Euler's totient φ(58330) = 22032 numbers up to 58330 share no factor with it.
- 4
The digits of 58330 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58330 = 2 \times 5 \times 19 \times 307 \]
58330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 110880 |
| Euler totient φ(n) | 22032 |
| Square | 3402388900 |
| Cube | 198461344537000 |
| Square root | 241.516045 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.833 × |
58330 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand three hundred and thirty |
| Binary (base 2) | 1110001111011010 |
| Octal (base 8) | 161732 |
| Hexadecimal (base 16) | E3DA |
| Base 3 | 2222000101 |
| As time | 58330 seconds = 16 h 12 min 10 s |
Is 58330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58330 ÷ 2 = 29165) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | Yes (58330 ÷ 5 = 11666) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (58330 ÷ 10 = 5833) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58330 a prime number?
No. 58330 = 2 × 5 × 19 × 307, so it is divisible by 2.
What are the factors of 58330?
1, 2, 5, 10, 19, 38, 95, 190, 307, 614, 1535, 3070, 5833, 11666, 29165, 58330.
What is 58330 in binary?
1110001111011010 (hexadecimal E3DA, octal 161732).
What is the square root of 58330?
About 241.5160.
Is 58330 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 58330?
58330 is a Harshad number: divisible by its digit sum 19.