The number 59080
59080 is a composite number with 32 divisors. Its prime factorisation is × 5 × 7 × 211. Divisors (32): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 211 … 59080.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59080 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59080 is composite. Its prime factorisation is
- 3
The divisors add up to 152640; without 59080 itself that is 93560, so 59080 is abundant (93560 is more than 59080). Euler's totient φ(59080) = 20160 numbers up to 59080 share no factor with it.
- 4
The digits of 59080 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59080 = 2^{3} \times 5 \times 7 \times 211 \]59080 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 152640 |
| Euler totient φ(n) | 20160 |
| Square | 3490446400 |
| Cube | 206215573312000 |
| Square root | 243.063778 (= 2√14770) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.908 × |
59080 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and eighty |
| Binary (base 2) | 1110011011001000 |
| Octal (base 8) | 163310 |
| Hexadecimal (base 16) | E6C8 |
| Base 3 | 10000001011 |
| As time | 59080 seconds = 16 h 24 min 40 s |
Is 59080 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59080 ÷ 2 = 29540) | 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 | Yes (59080 ÷ 4 = 14770) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59080 ÷ 5 = 11816) | 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 | Yes (59080 ÷ 7 = 8440) | 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 | Yes (59080 ÷ 8 = 7385) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59080 ÷ 10 = 5908) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59080 a prime number?
No. 59080 = × 5 × 7 × 211, so it is divisible by 2.
What are the factors of 59080?
1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 211, 280, 422, 844, 1055, 1477, 1688, 2110, 2954, 4220, 5908, 7385, 8440, 11816, 14770, 29540, 59080.
What is 59080 in binary?
1110011011001000 (hexadecimal E6C8, octal 163310).
What is the square root of 59080?
About 243.0638, exactly 2√14770.
Is 59080 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 59080?
It is a composite number with 32 divisors.