The number 16961
16961 is a palindrome: it reads 16961 backwards too. Its prime factorisation is 7 × 2423. Divisors (4): 1, 7, 2423, 16961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16961: a palindrome: it reads 16961 backwards too; a semiprime: 7 × 2423, the product of two primes.
- 2
16961 is composite. Its prime factorisation is
- 3
The divisors add up to 19392; without 16961 itself that is 2431, so 16961 is deficient (2431 is less than 16961). Euler's totient φ(16961) = 14532 numbers up to 16961 share no factor with it.
- 4
The digits of 16961 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 110 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16961 = 7 \times 2423 \]
16961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19392 |
| Euler totient φ(n) | 14532 |
| Square | 287675521 |
| Cube | 4879264511681 |
| Square root | 130.234404 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 110 |
| Scientific notation | 1.6961 × |
16961 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and sixty-one |
| Binary (base 2) | 100001001000001 |
| Octal (base 8) | 41101 |
| Hexadecimal (base 16) | 4241 |
| Base 3 | 212021012 |
| As time | 16961 seconds = 4 h 42 min 41 s |
Is 16961 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 | Yes (16961 ÷ 7 = 2423) | 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 1) | 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 10) | 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 16961 a prime number?
No. 16961 = 7 × 2423, so it is divisible by 7.
What are the factors of 16961?
1, 7, 2423, 16961.
What is 16961 in binary?
100001001000001 (hexadecimal 4241, octal 41101).
What is the square root of 16961?
About 130.2344.
Is 16961 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 16961?
16961 is a palindrome: it reads 16961 backwards too; a semiprime: 7 × 2423, the product of two primes.