The number 16852
16852 is a composite number with 12 divisors. Its prime factorisation is × 11 × 383. Divisors (12): 1, 2, 4, 11, 22, 44, 383, 766, 1532, 4213, 8426, 16852.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16852: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 22.
- 2
16852 is composite. Its prime factorisation is
- 3
The divisors add up to 32256; without 16852 itself that is 15404, so 16852 is deficient (15404 is less than 16852). Euler's totient φ(16852) = 7640 numbers up to 16852 share no factor with it.
- 4
The digits of 16852 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16852 = 2^{2} \times 11 \times 383 \]16852 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 32256 |
| Euler totient φ(n) | 7640 |
| Square | 283989904 |
| Cube | 4785797862208 |
| Square root | 129.815253 (= 2√4213) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.6852 × |
16852 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand eight hundred and fifty-two |
| Binary (base 2) | 100000111010100 |
| Octal (base 8) | 40724 |
| Hexadecimal (base 16) | 41D4 |
| Base 3 | 212010011 |
| As time | 16852 seconds = 4 h 40 min 52 s |
Is 16852 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16852 ÷ 2 = 8426) | 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 | Yes (16852 ÷ 4 = 4213) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | No (remainder 4) | 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 (16852 ÷ 11 = 1532) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16852 a prime number?
No. 16852 = × 11 × 383, so it is divisible by 2.
What are the factors of 16852?
1, 2, 4, 11, 22, 44, 383, 766, 1532, 4213, 8426, 16852.
What is 16852 in binary?
100000111010100 (hexadecimal 41D4, octal 40724).
What is the square root of 16852?
About 129.8153, exactly 2√4213.
Is 16852 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 16852?
16852 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 22.