The number 14202
14202 is a composite number with 16 divisors. Its prime factorisation is 2 × × 263. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 263, 526, 789, 1578, 2367, 4734, 7101, 14202.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14202: a Harshad number: divisible by its digit sum 9.
- 2
14202 is composite. Its prime factorisation is
- 3
The divisors add up to 31680; without 14202 itself that is 17478, so 14202 is abundant (17478 is more than 14202). Euler's totient φ(14202) = 4716 numbers up to 14202 share no factor with it.
- 4
The digits of 14202 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14202 = 2 \times 3^{3} \times 263 \]14202 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 31680 |
| Euler totient φ(n) | 4716 |
| Square | 201696804 |
| Cube | 2864498010408 |
| Square root | 119.172144 (= 3√1578) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4202 × |
14202 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and two |
| Binary (base 2) | 11011101111010 |
| Octal (base 8) | 33572 |
| Hexadecimal (base 16) | 377A |
| Base 3 | 201111000 |
| As time | 14202 seconds = 3 h 56 min 42 s |
Is 14202 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14202 ÷ 2 = 7101) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14202 ÷ 3 = 4734) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 (14202 ÷ 6 = 2367) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14202 ÷ 9 = 1578) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14202 a prime number?
No. 14202 = 2 × × 263, so it is divisible by 2.
What are the factors of 14202?
1, 2, 3, 6, 9, 18, 27, 54, 263, 526, 789, 1578, 2367, 4734, 7101, 14202.
What is 14202 in binary?
11011101111010 (hexadecimal 377A, octal 33572).
What is the square root of 14202?
About 119.1721, exactly 3√1578.
Is 14202 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 14202?
14202 is a Harshad number: divisible by its digit sum 9.