The number 17061
17061 is a composite number with 12 divisors. Its prime factorisation is 3 × × 47. Divisors (12): 1, 3, 11, 33, 47, 121, 141, 363, 517, 1551, 5687, 17061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
17061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
17061 is composite. Its prime factorisation is
- 3
The divisors add up to 25536; without 17061 itself that is 8475, so 17061 is deficient (8475 is less than 17061). Euler's totient φ(17061) = 10120 numbers up to 17061 share no factor with it.
- 4
The digits of 17061 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 172 steps to reach 1.
LaTeX source of the formulas on this page
\[ 17061 = 3 \times 11^{2} \times 47 \]17061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 25536 |
| Euler totient φ(n) | 10120 |
| Square | 291077721 |
| Cube | 4966076997981 |
| Square root | 130.617763 (= 11√141) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 172 |
| Scientific notation | 1.7061 × |
17061 in other forms
| Form | Value |
|---|---|
| In words | seventeen thousand and sixty-one |
| Binary (base 2) | 100001010100101 |
| Octal (base 8) | 41245 |
| Hexadecimal (base 16) | 42A5 |
| Base 3 | 212101220 |
| As time | 17061 seconds = 4 h 44 min 21 s |
Is 17061 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 | Yes (17061 ÷ 3 = 5687) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (17061 ÷ 11 = 1551) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 17061 a prime number?
No. 17061 = 3 × × 47, so it is divisible by 3.
What are the factors of 17061?
1, 3, 11, 33, 47, 121, 141, 363, 517, 1551, 5687, 17061.
What is 17061 in binary?
100001010100101 (hexadecimal 42A5, octal 41245).
What is the square root of 17061?
About 130.6178, exactly 11√141.
Is 17061 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 17061?
It is a composite number with 12 divisors.