The number 59130
59130 is a composite number with 40 divisors. Its prime factorisation is 2 × × 5 × 73. Divisors (40): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 73, 81, 90 … 59130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59130: a Harshad number: divisible by its digit sum 18.
- 2
59130 is composite. Its prime factorisation is
- 3
The divisors add up to 161172; without 59130 itself that is 102042, so 59130 is abundant (102042 is more than 59130). Euler's totient φ(59130) = 15552 numbers up to 59130 share no factor with it.
- 4
The digits of 59130 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 210 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59130 = 2 \times 3^{4} \times 5 \times 73 \]59130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 161172 |
| Euler totient φ(n) | 15552 |
| Square | 3496356900 |
| Cube | 206739583497000 |
| Square root | 243.166610 (= 9√730) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 210 |
| Scientific notation | 5.913 × |
59130 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and thirty |
| Binary (base 2) | 1110011011111010 |
| Octal (base 8) | 163372 |
| Hexadecimal (base 16) | E6FA |
| Base 3 | 10000010000 |
| As time | 59130 seconds = 16 h 25 min 30 s |
Is 59130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59130 ÷ 2 = 29565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59130 ÷ 3 = 19710) | 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 (59130 ÷ 5 = 11826) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (59130 ÷ 6 = 9855) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (59130 ÷ 9 = 6570) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59130 ÷ 10 = 5913) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 59130 a prime number?
No. 59130 = 2 × × 5 × 73, so it is divisible by 2.
What are the factors of 59130?
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 73, 81, 90, 135, 146, 162, 219, 270, 365, 405, 438, 657, 730, 810, 1095, 1314, 1971, 2190, 3285, 3942, 5913, 6570, 9855, 11826, 19710, 29565, 59130.
What is 59130 in binary?
1110011011111010 (hexadecimal E6FA, octal 163372).
What is the square root of 59130?
About 243.1666, exactly 9√730.
Is 59130 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 59130?
59130 is a Harshad number: divisible by its digit sum 18.