The number 16951
16951 is a composite number with 8 divisors. Its prime factorisation is 11 × 23 × 67. Divisors (8): 1, 11, 23, 67, 253, 737, 1541, 16951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16951 is composite. Its prime factorisation is
- 3
The divisors add up to 19584; without 16951 itself that is 2633, so 16951 is deficient (2633 is less than 16951). Euler's totient φ(16951) = 14520 numbers up to 16951 share no factor with it.
- 4
The digits of 16951 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 110 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16951 = 11 \times 23 \times 67 \]
16951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19584 |
| Euler totient φ(n) | 14520 |
| Square | 287336401 |
| Cube | 4870639333351 |
| Square root | 130.196006 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 110 |
| Scientific notation | 1.6951 × |
16951 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and fifty-one |
| Binary (base 2) | 100001000110111 |
| Octal (base 8) | 41067 |
| Hexadecimal (base 16) | 4237 |
| Base 3 | 212020211 |
| As time | 16951 seconds = 4 h 42 min 31 s |
Is 16951 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 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (16951 ÷ 11 = 1541) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16951 a prime number?
No. 16951 = 11 × 23 × 67, so it is divisible by 11.
What are the factors of 16951?
1, 11, 23, 67, 253, 737, 1541, 16951.
What is 16951 in binary?
100001000110111 (hexadecimal 4237, octal 41067).
What is the square root of 16951?
About 130.1960.
Is 16951 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 16951?
It is a composite number with 8 divisors.