The number 14253
14253 is a composite number with 4 divisors. Its prime factorisation is 3 × 4751. Divisors (4): 1, 3, 4751, 14253.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14253: a semiprime: 3 × 4751, the product of two primes.
- 2
14253 is composite. Its prime factorisation is
- 3
The divisors add up to 19008; without 14253 itself that is 4755, so 14253 is deficient (4755 is less than 14253). Euler's totient φ(14253) = 9500 numbers up to 14253 share no factor with it.
- 4
The digits of 14253 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14253 = 3 \times 4751 \]
14253 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19008 |
| Euler totient φ(n) | 9500 |
| Square | 203148009 |
| Cube | 2895468572277 |
| Square root | 119.385929 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4253 × |
14253 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and fifty-three |
| Binary (base 2) | 11011110101101 |
| Octal (base 8) | 33655 |
| Hexadecimal (base 16) | 37AD |
| Base 3 | 201112220 |
| As time | 14253 seconds = 3 h 57 min 33 s |
Is 14253 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14253 ÷ 3 = 4751) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14253 a prime number?
No. 14253 = 3 × 4751, so it is divisible by 3.
What are the factors of 14253?
1, 3, 4751, 14253.
What is 14253 in binary?
11011110101101 (hexadecimal 37AD, octal 33655).
What is the square root of 14253?
About 119.3859.
Is 14253 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14253?
14253 is a semiprime: 3 × 4751, the product of two primes.