The number 14252
14252 is a composite number with 12 divisors. Its prime factorisation is × 7 × 509. Divisors (12): 1, 2, 4, 7, 14, 28, 509, 1018, 2036, 3563, 7126, 14252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14252: a Harshad number: divisible by its digit sum 14.
- 2
14252 is composite. Its prime factorisation is
- 3
The divisors add up to 28560; without 14252 itself that is 14308, so 14252 is abundant (14308 is more than 14252). Euler's totient φ(14252) = 6096 numbers up to 14252 share no factor with it.
- 4
The digits of 14252 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14252 = 2^{2} \times 7 \times 509 \]14252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 28560 |
| Euler totient φ(n) | 6096 |
| Square | 203119504 |
| Cube | 2894859171008 |
| Square root | 119.381741 (= 2√3563) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4252 × |
14252 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and fifty-two |
| Binary (base 2) | 11011110101100 |
| Octal (base 8) | 33654 |
| Hexadecimal (base 16) | 37AC |
| Base 3 | 201112212 |
| As time | 14252 seconds = 3 h 57 min 32 s |
Is 14252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14252 ÷ 2 = 7126) | 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 (14252 ÷ 4 = 3563) | 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 | Yes (14252 ÷ 7 = 2036) | 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 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 7) | 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 14252 a prime number?
No. 14252 = × 7 × 509, so it is divisible by 2.
What are the factors of 14252?
1, 2, 4, 7, 14, 28, 509, 1018, 2036, 3563, 7126, 14252.
What is 14252 in binary?
11011110101100 (hexadecimal 37AC, octal 33654).
What is the square root of 14252?
About 119.3817, exactly 2√3563.
Is 14252 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 14252?
14252 is a Harshad number: divisible by its digit sum 14.