The number 17141
17141 is a composite number with 4 divisors. Its prime factorisation is 61 × 281. Divisors (4): 1, 61, 281, 17141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 17141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 281, the product of two primes.
- 2
17141 is composite. Its prime factorisation is
- 3
The divisors add up to 17484; without 17141 itself that is 343, so 17141 is deficient (343 is less than 17141). Euler's totient φ(17141) = 16800 numbers up to 17141 share no factor with it.
- 4
The digits of 17141 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 172 steps to reach 1.
LaTeX source of the formulas on this page
\[ 17141 = 61 \times 281 \]
17141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17484 |
| Euler totient φ(n) | 16800 |
| Square | 293813881 |
| Cube | 5036263734221 |
| Square root | 130.923642 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 172 |
| Scientific notation | 1.7141 × |
17141 in other forms
| Form | Value |
|---|---|
| In words | seventeen thousand one hundred and forty-one |
| Binary (base 2) | 100001011110101 |
| Octal (base 8) | 41365 |
| Hexadecimal (base 16) | 42F5 |
| Base 3 | 212111212 |
| As time | 17141 seconds = 4 h 45 min 41 s |
Is 17141 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 2) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 17141 a prime number?
No. 17141 = 61 × 281, so it is divisible by 61.
What are the factors of 17141?
1, 61, 281, 17141.
What is 17141 in binary?
100001011110101 (hexadecimal 42F5, octal 41365).
What is the square root of 17141?
About 130.9236.
Is 17141 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 17141?
17141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 281, the product of two primes.