The number 16952
16952 is a composite number with 16 divisors. Its prime factorisation is × 13 × 163. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 163, 326, 652, 1304, 2119, 4238, 8476, 16952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16952 is composite. Its prime factorisation is
- 3
The divisors add up to 34440; without 16952 itself that is 17488, so 16952 is abundant (17488 is more than 16952). Euler's totient φ(16952) = 7776 numbers up to 16952 share no factor with it.
- 4
The digits of 16952 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16952 = 2^{3} \times 13 \times 163 \]16952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 34440 |
| Euler totient φ(n) | 7776 |
| Square | 287370304 |
| Cube | 4871501393408 |
| Square root | 130.199846 (= 2√4238) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.6952 × |
16952 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and fifty-two |
| Binary (base 2) | 100001000111000 |
| Octal (base 8) | 41070 |
| Hexadecimal (base 16) | 4238 |
| Base 3 | 212020212 |
| As time | 16952 seconds = 4 h 42 min 32 s |
Is 16952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16952 ÷ 2 = 8476) | 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 | Yes (16952 ÷ 4 = 4238) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (16952 ÷ 8 = 2119) | 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 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16952 a prime number?
No. 16952 = × 13 × 163, so it is divisible by 2.
What are the factors of 16952?
1, 2, 4, 8, 13, 26, 52, 104, 163, 326, 652, 1304, 2119, 4238, 8476, 16952.
What is 16952 in binary?
100001000111000 (hexadecimal 4238, octal 41070).
What is the square root of 16952?
About 130.1998, exactly 2√4238.
Is 16952 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 16952?
It is a composite number with 16 divisors.