The number 61370
61370 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × 17 × . Divisors (24): 1, 2, 5, 10, 17, 19, 34, 38, 85, 95, 170, 190, 323, 361, 646, 722 … 61370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61370: a Harshad number: divisible by its digit sum 17.
- 2
61370 is composite. Its prime factorisation is
- 3
The divisors add up to 123444; without 61370 itself that is 62074, so 61370 is abundant (62074 is more than 61370). Euler's totient φ(61370) = 21888 numbers up to 61370 share no factor with it.
- 4
The digits of 61370 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61370 = 2 \times 5 \times 17 \times 19^{2} \]61370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 123444 |
| Euler totient φ(n) | 21888 |
| Square | 3766276900 |
| Cube | 231136413353000 |
| Square root | 247.729691 (= 19√170) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 135 |
| Scientific notation | 6.137 × |
61370 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand three hundred and seventy |
| Binary (base 2) | 1110111110111010 |
| Octal (base 8) | 167672 |
| Hexadecimal (base 16) | EFBA |
| Base 3 | 10010011222 |
| As time | 61370 seconds = 17 h 2 min 50 s |
Is 61370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61370 ÷ 2 = 30685) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (61370 ÷ 5 = 12274) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (61370 ÷ 10 = 6137) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61370 a prime number?
No. 61370 = 2 × 5 × 17 × , so it is divisible by 2.
What are the factors of 61370?
1, 2, 5, 10, 17, 19, 34, 38, 85, 95, 170, 190, 323, 361, 646, 722, 1615, 1805, 3230, 3610, 6137, 12274, 30685, 61370.
What is 61370 in binary?
1110111110111010 (hexadecimal EFBA, octal 167672).
What is the square root of 61370?
About 247.7297, exactly 19√170.
Is 61370 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 61370?
61370 is a Harshad number: divisible by its digit sum 17.