The number 14053
14053 is a composite number with 8 divisors. Its prime factorisation is 13 × 23 × 47. Divisors (8): 1, 13, 23, 47, 299, 611, 1081, 14053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14053: a Harshad number: divisible by its digit sum 13.
- 2
14053 is composite. Its prime factorisation is
- 3
The divisors add up to 16128; without 14053 itself that is 2075, so 14053 is deficient (2075 is less than 14053). Euler's totient φ(14053) = 12144 numbers up to 14053 share no factor with it.
- 4
The digits of 14053 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14053 = 13 \times 23 \times 47 \]
14053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16128 |
| Euler totient φ(n) | 12144 |
| Square | 197486809 |
| Cube | 2775282126877 |
| Square root | 118.545350 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4053 × |
14053 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and fifty-three |
| Binary (base 2) | 11011011100101 |
| Octal (base 8) | 33345 |
| Hexadecimal (base 16) | 36E5 |
| Base 3 | 201021111 |
| As time | 14053 seconds = 3 h 54 min 13 s |
Is 14053 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14053 a prime number?
No. 14053 = 13 × 23 × 47, so it is divisible by 13.
What are the factors of 14053?
1, 13, 23, 47, 299, 611, 1081, 14053.
What is 14053 in binary?
11011011100101 (hexadecimal 36E5, octal 33345).
What is the square root of 14053?
About 118.5453.
Is 14053 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 14053?
14053 is a Harshad number: divisible by its digit sum 13.