The number 16962
16962 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 11 × 257. Divisors (16): 1, 2, 3, 6, 11, 22, 33, 66, 257, 514, 771, 1542, 2827, 5654, 8481, 16962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16962 is composite. Its prime factorisation is
- 3
The divisors add up to 37152; without 16962 itself that is 20190, so 16962 is abundant (20190 is more than 16962). Euler's totient φ(16962) = 5120 numbers up to 16962 share no factor with it.
- 4
The digits of 16962 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 110 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16962 = 2 \times 3 \times 11 \times 257 \]
16962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 37152 |
| Euler totient φ(n) | 5120 |
| Square | 287709444 |
| Cube | 4880127589128 |
| Square root | 130.238243 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 110 |
| Scientific notation | 1.6962 × |
16962 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and sixty-two |
| Binary (base 2) | 100001001000010 |
| Octal (base 8) | 41102 |
| Hexadecimal (base 16) | 4242 |
| Base 3 | 212021020 |
| As time | 16962 seconds = 4 h 42 min 42 s |
Is 16962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16962 ÷ 2 = 8481) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16962 ÷ 3 = 5654) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (16962 ÷ 6 = 2827) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (16962 ÷ 11 = 1542) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16962 a prime number?
No. 16962 = 2 × 3 × 11 × 257, so it is divisible by 2.
What are the factors of 16962?
1, 2, 3, 6, 11, 22, 33, 66, 257, 514, 771, 1542, 2827, 5654, 8481, 16962.
What is 16962 in binary?
100001001000010 (hexadecimal 4242, octal 41102).
What is the square root of 16962?
About 130.2382.
Is 16962 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 16962?
It is a composite number with 16 divisors.