The number 16941
16941 is a composite number with 4 divisors. Its prime factorisation is 3 × 5647. Divisors (4): 1, 3, 5647, 16941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16941: a semiprime: 3 × 5647, the product of two primes.
- 2
16941 is composite. Its prime factorisation is
- 3
The divisors add up to 22592; without 16941 itself that is 5651, so 16941 is deficient (5651 is less than 16941). Euler's totient φ(16941) = 11292 numbers up to 16941 share no factor with it.
- 4
The digits of 16941 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16941 = 3 \times 5647 \]
16941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22592 |
| Euler totient φ(n) | 11292 |
| Square | 286997481 |
| Cube | 4862024325621 |
| Square root | 130.157597 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.6941 × |
16941 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and forty-one |
| Binary (base 2) | 100001000101101 |
| Octal (base 8) | 41055 |
| Hexadecimal (base 16) | 422D |
| Base 3 | 212020110 |
| As time | 16941 seconds = 4 h 42 min 21 s |
Is 16941 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 (16941 ÷ 3 = 5647) | 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 1) | 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 3) | 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 1) | 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 16941 a prime number?
No. 16941 = 3 × 5647, so it is divisible by 3.
What are the factors of 16941?
1, 3, 5647, 16941.
What is 16941 in binary?
100001000101101 (hexadecimal 422D, octal 41055).
What is the square root of 16941?
About 130.1576.
Is 16941 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 16941?
16941 is a semiprime: 3 × 5647, the product of two primes.