The number 14063
14063 is a composite number with 8 divisors. Its prime factorisation is Ć 41. Divisors (8): 1, 7, 41, 49, 287, 343, 2009, 14063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14063 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14063 is composite. Its prime factorisation is
- 3
The divisors add up to 16800; without 14063 itself that is 2737, so 14063 is deficient (2737 is less than 14063). Euler's totient Ļ(14063) = 11760 numbers up to 14063 share no factor with it.
- 4
The digits of 14063 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14063 = 7^{3} \times 41 \]14063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16800 |
| Euler totient Ļ(n) | 11760 |
| Square | 197767969 |
| Cube | 2781210948047 |
| Square root | 118.587520 (= 7ā287) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.4063 Ć |
14063 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and sixty-three |
| Binary (base 2) | 11011011101111 |
| Octal (base 8) | 33357 |
| Hexadecimal (base 16) | 36EF |
| Base 3 | 201021212 |
| As time | 14063 seconds = 3 h 54 min 23 s |
Is 14063 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14063 Ć· 7 = 2009) | 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 7) | 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 3) | 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 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14063 a prime number?
No. 14063 = Ć 41, so it is divisible by 7.
What are the factors of 14063?
1, 7, 41, 49, 287, 343, 2009, 14063.
What is 14063 in binary?
11011011101111 (hexadecimal 36EF, octal 33357).
What is the square root of 14063?
About 118.5875, exactly 7ā287.
Is 14063 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 14063?
It is a composite number with 8 divisors.