The number 61580
61580 is a composite number with 12 divisors. Its prime factorisation is × 5 × 3079. Divisors (12): 1, 2, 4, 5, 10, 20, 3079, 6158, 12316, 15395, 30790, 61580.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61580: a Harshad number: divisible by its digit sum 20.
- 2
61580 is composite. Its prime factorisation is
- 3
The divisors add up to 129360; without 61580 itself that is 67780, so 61580 is abundant (67780 is more than 61580). Euler's totient φ(61580) = 24624 numbers up to 61580 share no factor with it.
- 4
The digits of 61580 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61580 = 2^{2} \times 5 \times 3079 \]61580 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 129360 |
| Euler totient φ(n) | 24624 |
| Square | 3792096400 |
| Cube | 233517296312000 |
| Square root | 248.153179 (= 2√15395) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.158 × |
61580 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and eighty |
| Binary (base 2) | 1111000010001100 |
| Octal (base 8) | 170214 |
| Hexadecimal (base 16) | F08C |
| Base 3 | 10010110202 |
| As time | 61580 seconds = 17 h 6 min 20 s |
Is 61580 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61580 ÷ 2 = 30790) | 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 | Yes (61580 ÷ 4 = 15395) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (61580 ÷ 5 = 12316) | 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 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 4) | 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 (61580 ÷ 10 = 6158) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61580 a prime number?
No. 61580 = × 5 × 3079, so it is divisible by 2.
What are the factors of 61580?
1, 2, 4, 5, 10, 20, 3079, 6158, 12316, 15395, 30790, 61580.
What is 61580 in binary?
1111000010001100 (hexadecimal F08C, octal 170214).
What is the square root of 61580?
About 248.1532, exactly 2√15395.
Is 61580 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 61580?
61580 is a Harshad number: divisible by its digit sum 20.