The number 59030
59030 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5903. Divisors (8): 1, 2, 5, 10, 5903, 11806, 29515, 59030.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59030 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59030 is composite. Its prime factorisation is
- 3
The divisors add up to 106272; without 59030 itself that is 47242, so 59030 is deficient (47242 is less than 59030). Euler's totient φ(59030) = 23608 numbers up to 59030 share no factor with it.
- 4
The digits of 59030 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59030 = 2 \times 5 \times 5903 \]
59030 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 106272 |
| Euler totient φ(n) | 23608 |
| Square | 3484540900 |
| Cube | 205692449327000 |
| Square root | 242.960902 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.903 × |
59030 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and thirty |
| Binary (base 2) | 1110011010010110 |
| Octal (base 8) | 163226 |
| Hexadecimal (base 16) | E696 |
| Base 3 | 2222222022 |
| As time | 59030 seconds = 16 h 23 min 50 s |
Is 59030 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59030 ÷ 2 = 29515) | 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 (59030 ÷ 5 = 11806) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59030 ÷ 10 = 5903) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59030 a prime number?
No. 59030 = 2 × 5 × 5903, so it is divisible by 2.
What are the factors of 59030?
1, 2, 5, 10, 5903, 11806, 29515, 59030.
What is 59030 in binary?
1110011010010110 (hexadecimal E696, octal 163226).
What is the square root of 59030?
About 242.9609.
Is 59030 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 59030?
It is a composite number with 8 divisors.