The number 12852
12852 is a composite number with 48 divisors. Its prime factorisation is × × 7 × 17. Divisors (48): 1, 2, 3, 4, 6, 7, 9, 12, 14, 17, 18, 21, 27, 28, 34, 36 … 12852.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12852: a Harshad number: divisible by its digit sum 18.
- 2
12852 is composite. Its prime factorisation is
- 3
The divisors add up to 40320; without 12852 itself that is 27468, so 12852 is abundant (27468 is more than 12852). Euler's totient φ(12852) = 3456 numbers up to 12852 share no factor with it.
- 4
The digits of 12852 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 24 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12852 = 2^{2} \times 3^{3} \times 7 \times 17 \]12852 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 40320 |
| Euler totient φ(n) | 3456 |
| Square | 165173904 |
| Cube | 2122815014208 |
| Square root | 113.366662 (= 6√357) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 24 |
| Scientific notation | 1.2852 × |
12852 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand eight hundred and fifty-two |
| Binary (base 2) | 11001000110100 |
| Octal (base 8) | 31064 |
| Hexadecimal (base 16) | 3234 |
| Base 3 | 122122000 |
| As time | 12852 seconds = 3 h 34 min 12 s |
Is 12852 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12852 ÷ 2 = 6426) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12852 ÷ 3 = 4284) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (12852 ÷ 4 = 3213) | 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 (12852 ÷ 6 = 2142) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12852 ÷ 7 = 1836) | 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 (12852 ÷ 9 = 1428) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (12852 ÷ 12 = 1071) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12852 a prime number?
No. 12852 = × × 7 × 17, so it is divisible by 2.
What are the factors of 12852?
1, 2, 3, 4, 6, 7, 9, 12, 14, 17, 18, 21, 27, 28, 34, 36, 42, 51, 54, 63, 68, 84, 102, 108, 119, 126, 153, 189, 204, 238, 252, 306, 357, 378, 459, 476, 612, 714, 756, 918, 1071, 1428, 1836, 2142, 3213, 4284, 6426, 12852.
What is 12852 in binary?
11001000110100 (hexadecimal 3234, octal 31064).
What is the square root of 12852?
About 113.3667, exactly 6√357.
Is 12852 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 12852?
12852 is a Harshad number: divisible by its digit sum 18.