The number 14052
14052 is a composite number with 12 divisors. Its prime factorisation is × 3 × 1171. Divisors (12): 1, 2, 3, 4, 6, 12, 1171, 2342, 3513, 4684, 7026, 14052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14052: a Harshad number: divisible by its digit sum 12.
- 2
14052 is composite. Its prime factorisation is
- 3
The divisors add up to 32816; without 14052 itself that is 18764, so 14052 is abundant (18764 is more than 14052). Euler's totient φ(14052) = 4680 numbers up to 14052 share no factor with it.
- 4
The digits of 14052 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14052 = 2^{2} \times 3 \times 1171 \]14052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 32816 |
| Euler totient φ(n) | 4680 |
| Square | 197458704 |
| Cube | 2774689708608 |
| Square root | 118.541132 (= 2√3513) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4052 × |
14052 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and fifty-two |
| Binary (base 2) | 11011011100100 |
| Octal (base 8) | 33344 |
| Hexadecimal (base 16) | 36E4 |
| Base 3 | 201021110 |
| As time | 14052 seconds = 3 h 54 min 12 s |
Is 14052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14052 ÷ 2 = 7026) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14052 ÷ 3 = 4684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14052 ÷ 4 = 3513) | 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 (14052 ÷ 6 = 2342) | 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 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (14052 ÷ 12 = 1171) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14052 a prime number?
No. 14052 = × 3 × 1171, so it is divisible by 2.
What are the factors of 14052?
1, 2, 3, 4, 6, 12, 1171, 2342, 3513, 4684, 7026, 14052.
What is 14052 in binary?
11011011100100 (hexadecimal 36E4, octal 33344).
What is the square root of 14052?
About 118.5411, exactly 2√3513.
Is 14052 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 14052?
14052 is a Harshad number: divisible by its digit sum 12.