The number 61567
61567 is a composite number with 8 divisors. Its prime factorisation is 11 × 29 × 193. Divisors (8): 1, 11, 29, 193, 319, 2123, 5597, 61567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61567 is composite. Its prime factorisation is
- 3
The divisors add up to 69840; without 61567 itself that is 8273, so 61567 is deficient (8273 is less than 61567). Euler's totient φ(61567) = 53760 numbers up to 61567 share no factor with it.
- 4
The digits of 61567 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61567 = 11 \times 29 \times 193 \]
61567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 69840 |
| Euler totient φ(n) | 53760 |
| Square | 3790495489 |
| Cube | 233369435771263 |
| Square root | 248.126984 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.1567 × |
61567 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and sixty-seven |
| Binary (base 2) | 1111000001111111 |
| Octal (base 8) | 170177 |
| Hexadecimal (base 16) | F07F |
| Base 3 | 10010110021 |
| As time | 61567 seconds = 17 h 6 min 7 s |
Is 61567 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (61567 ÷ 11 = 5597) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61567 a prime number?
No. 61567 = 11 × 29 × 193, so it is divisible by 11.
What are the factors of 61567?
1, 11, 29, 193, 319, 2123, 5597, 61567.
What is 61567 in binary?
1111000001111111 (hexadecimal F07F, octal 170177).
What is the square root of 61567?
About 248.1270.
Is 61567 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 61567?
It is a composite number with 8 divisors.