The number 17149
17149 is a composite number with 4 divisors. Its prime factorisation is 11 × 1559. Divisors (4): 1, 11, 1559, 17149.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 17149: a semiprime: 11 × 1559, the product of two primes.
- 2
17149 is composite. Its prime factorisation is
- 3
The divisors add up to 18720; without 17149 itself that is 1571, so 17149 is deficient (1571 is less than 17149). Euler's totient φ(17149) = 15580 numbers up to 17149 share no factor with it.
- 4
The digits of 17149 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 17149 = 11 \times 1559 \]
17149 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18720 |
| Euler totient φ(n) | 15580 |
| Square | 294088201 |
| Cube | 5043318558949 |
| Square root | 130.954190 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.7149 × |
17149 in other forms
| Form | Value |
|---|---|
| In words | seventeen thousand one hundred and forty-nine |
| Binary (base 2) | 100001011111101 |
| Octal (base 8) | 41375 |
| Hexadecimal (base 16) | 42FD |
| Base 3 | 212112011 |
| As time | 17149 seconds = 4 h 45 min 49 s |
Is 17149 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 6) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (17149 ÷ 11 = 1559) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 17149 a prime number?
No. 17149 = 11 × 1559, so it is divisible by 11.
What are the factors of 17149?
1, 11, 1559, 17149.
What is 17149 in binary?
100001011111101 (hexadecimal 42FD, octal 41375).
What is the square root of 17149?
About 130.9542.
Is 17149 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 17149?
17149 is a semiprime: 11 × 1559, the product of two primes.