The number 14463
14463 is a composite number with 6 divisors. Its prime factorisation is × 1607. Divisors (6): 1, 3, 9, 1607, 4821, 14463.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14463 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14463 is composite. Its prime factorisation is
- 3
The divisors add up to 20904; without 14463 itself that is 6441, so 14463 is deficient (6441 is less than 14463). Euler's totient φ(14463) = 9636 numbers up to 14463 share no factor with it.
- 4
The digits of 14463 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14463 = 3^{2} \times 1607 \]14463 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 20904 |
| Euler totient φ(n) | 9636 |
| Square | 209178369 |
| Cube | 3025346750847 |
| Square root | 120.262214 (= 3√1607) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.4463 × |
14463 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and sixty-three |
| Binary (base 2) | 11100001111111 |
| Octal (base 8) | 34177 |
| Hexadecimal (base 16) | 387F |
| Base 3 | 201211200 |
| As time | 14463 seconds = 4 h 1 min 3 s |
Is 14463 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 (14463 ÷ 3 = 4821) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14463 ÷ 9 = 1607) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14463 a prime number?
No. 14463 = × 1607, so it is divisible by 3.
What are the factors of 14463?
1, 3, 9, 1607, 4821, 14463.
What is 14463 in binary?
11100001111111 (hexadecimal 387F, octal 34177).
What is the square root of 14463?
About 120.2622, exactly 3√1607.
Is 14463 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14463?
It is a composite number with 6 divisors.