The number 61020
61020 is a composite number with 48 divisors. Its prime factorisation is × × 5 × 113. Divisors (48): 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 45 … 61020.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61020: a Harshad number: divisible by its digit sum 9.
- 2
61020 is composite. Its prime factorisation is
- 3
The divisors add up to 191520; without 61020 itself that is 130500, so 61020 is abundant (130500 is more than 61020). Euler's totient φ(61020) = 16128 numbers up to 61020 share no factor with it.
- 4
The digits of 61020 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61020 = 2^{2} \times 3^{3} \times 5 \times 113 \]61020 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 191520 |
| Euler totient φ(n) | 16128 |
| Square | 3723440400 |
| Cube | 227204333208000 |
| Square root | 247.022266 (= 6√1695) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.102 × |
61020 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand and twenty |
| Binary (base 2) | 1110111001011100 |
| Octal (base 8) | 167134 |
| Hexadecimal (base 16) | EE5C |
| Base 3 | 10002201000 |
| As time | 61020 seconds = 16 h 57 min 0 s |
Is 61020 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61020 ÷ 2 = 30510) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (61020 ÷ 3 = 20340) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (61020 ÷ 4 = 15255) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (61020 ÷ 5 = 12204) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (61020 ÷ 6 = 10170) | 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 | Yes (61020 ÷ 9 = 6780) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (61020 ÷ 10 = 6102) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (61020 ÷ 12 = 5085) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61020 a prime number?
No. 61020 = × × 5 × 113, so it is divisible by 2.
What are the factors of 61020?
1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 45, 54, 60, 90, 108, 113, 135, 180, 226, 270, 339, 452, 540, 565, 678, 1017, 1130, 1356, 1695, 2034, 2260, 3051, 3390, 4068, 5085, 6102, 6780, 10170, 12204, 15255, 20340, 30510, 61020.
What is 61020 in binary?
1110111001011100 (hexadecimal EE5C, octal 167134).
What is the square root of 61020?
About 247.0223, exactly 6√1695.
Is 61020 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 61020?
61020 is a Harshad number: divisible by its digit sum 9.