The number 16956
16956 is a composite number with 24 divisors. Its prime factorisation is × × 157. Divisors (24): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 157, 314, 471, 628 … 16956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16956: a Harshad number: divisible by its digit sum 27.
- 2
16956 is composite. Its prime factorisation is
- 3
The divisors add up to 44240; without 16956 itself that is 27284, so 16956 is abundant (27284 is more than 16956). Euler's totient φ(16956) = 5616 numbers up to 16956 share no factor with it.
- 4
The digits of 16956 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16956 = 2^{2} \times 3^{3} \times 157 \]16956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 44240 |
| Euler totient φ(n) | 5616 |
| Square | 287505936 |
| Cube | 4874950650816 |
| Square root | 130.215206 (= 6√471) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.6956 × |
16956 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and fifty-six |
| Binary (base 2) | 100001000111100 |
| Octal (base 8) | 41074 |
| Hexadecimal (base 16) | 423C |
| Base 3 | 212021000 |
| As time | 16956 seconds = 4 h 42 min 36 s |
Is 16956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16956 ÷ 2 = 8478) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16956 ÷ 3 = 5652) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16956 ÷ 4 = 4239) | 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 | Yes (16956 ÷ 6 = 2826) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (16956 ÷ 9 = 1884) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (16956 ÷ 12 = 1413) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16956 a prime number?
No. 16956 = × × 157, so it is divisible by 2.
What are the factors of 16956?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 157, 314, 471, 628, 942, 1413, 1884, 2826, 4239, 5652, 8478, 16956.
What is 16956 in binary?
100001000111100 (hexadecimal 423C, octal 41074).
What is the square root of 16956?
About 130.2152, exactly 6√471.
Is 16956 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 16956?
16956 is a Harshad number: divisible by its digit sum 27.