The number 61570
61570 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 47 × 131. Divisors (16): 1, 2, 5, 10, 47, 94, 131, 235, 262, 470, 655, 1310, 6157, 12314, 30785, 61570.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61570 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61570 is composite. Its prime factorisation is
- 3
The divisors add up to 114048; without 61570 itself that is 52478, so 61570 is deficient (52478 is less than 61570). Euler's totient φ(61570) = 23920 numbers up to 61570 share no factor with it.
- 4
The digits of 61570 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61570 = 2 \times 5 \times 47 \times 131 \]
61570 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 114048 |
| Euler totient φ(n) | 23920 |
| Square | 3790864900 |
| Cube | 233403551893000 |
| Square root | 248.133029 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 6.157 × |
61570 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and seventy |
| Binary (base 2) | 1111000010000010 |
| Octal (base 8) | 170202 |
| Hexadecimal (base 16) | F082 |
| Base 3 | 10010110101 |
| As time | 61570 seconds = 17 h 6 min 10 s |
Is 61570 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61570 ÷ 2 = 30785) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (61570 ÷ 5 = 12314) | 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 | No (remainder 5) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (61570 ÷ 10 = 6157) | 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 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61570 a prime number?
No. 61570 = 2 × 5 × 47 × 131, so it is divisible by 2.
What are the factors of 61570?
1, 2, 5, 10, 47, 94, 131, 235, 262, 470, 655, 1310, 6157, 12314, 30785, 61570.
What is 61570 in binary?
1111000010000010 (hexadecimal F082, octal 170202).
What is the square root of 61570?
About 248.1330.
Is 61570 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 61570?
It is a composite number with 16 divisors.