The number 59330
59330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 349. Divisors (16): 1, 2, 5, 10, 17, 34, 85, 170, 349, 698, 1745, 3490, 5933, 11866, 29665, 59330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59330 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59330 is composite. Its prime factorisation is
- 3
The divisors add up to 113400; without 59330 itself that is 54070, so 59330 is deficient (54070 is less than 59330). Euler's totient φ(59330) = 22272 numbers up to 59330 share no factor with it.
- 4
The digits of 59330 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59330 = 2 \times 5 \times 17 \times 349 \]
59330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 113400 |
| Euler totient φ(n) | 22272 |
| Square | 3520048900 |
| Cube | 208844501237000 |
| Square root | 243.577503 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.933 × |
59330 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand three hundred and thirty |
| Binary (base 2) | 1110011111000010 |
| Octal (base 8) | 163702 |
| Hexadecimal (base 16) | E7C2 |
| Base 3 | 10000101102 |
| As time | 59330 seconds = 16 h 28 min 50 s |
Is 59330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59330 ÷ 2 = 29665) | 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 | Yes (59330 ÷ 5 = 11866) | 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 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59330 ÷ 10 = 5933) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59330 a prime number?
No. 59330 = 2 × 5 × 17 × 349, so it is divisible by 2.
What are the factors of 59330?
1, 2, 5, 10, 17, 34, 85, 170, 349, 698, 1745, 3490, 5933, 11866, 29665, 59330.
What is 59330 in binary?
1110011111000010 (hexadecimal E7C2, octal 163702).
What is the square root of 59330?
About 243.5775.
Is 59330 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 59330?
It is a composite number with 16 divisors.