The number 61170
61170 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2039. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2039, 4078, 6117, 10195, 12234, 20390, 30585, 61170.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61170: a Harshad number: divisible by its digit sum 15.
- 2
61170 is composite. Its prime factorisation is
- 3
The divisors add up to 146880; without 61170 itself that is 85710, so 61170 is abundant (85710 is more than 61170). Euler's totient φ(61170) = 16304 numbers up to 61170 share no factor with it.
- 4
The digits of 61170 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61170 = 2 \times 3 \times 5 \times 2039 \]
61170 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 146880 |
| Euler totient φ(n) | 16304 |
| Square | 3741768900 |
| Cube | 228884003613000 |
| Square root | 247.325696 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 135 |
| Scientific notation | 6.117 × |
61170 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand one hundred and seventy |
| Binary (base 2) | 1110111011110010 |
| Octal (base 8) | 167362 |
| Hexadecimal (base 16) | EEF2 |
| Base 3 | 10002220120 |
| As time | 61170 seconds = 16 h 59 min 30 s |
Is 61170 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61170 ÷ 2 = 30585) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (61170 ÷ 3 = 20390) | 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 (61170 ÷ 5 = 12234) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (61170 ÷ 6 = 10195) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (61170 ÷ 10 = 6117) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61170 a prime number?
No. 61170 = 2 × 3 × 5 × 2039, so it is divisible by 2.
What are the factors of 61170?
1, 2, 3, 5, 6, 10, 15, 30, 2039, 4078, 6117, 10195, 12234, 20390, 30585, 61170.
What is 61170 in binary?
1110111011110010 (hexadecimal EEF2, octal 167362).
What is the square root of 61170?
About 247.3257.
Is 61170 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 61170?
61170 is a Harshad number: divisible by its digit sum 15.