The number 14663
14663 is a composite number with 8 divisors. Its prime factorisation is 11 × 31 × 43. Divisors (8): 1, 11, 31, 43, 341, 473, 1333, 14663.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14663 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14663 is composite. Its prime factorisation is
- 3
The divisors add up to 16896; without 14663 itself that is 2233, so 14663 is deficient (2233 is less than 14663). Euler's totient φ(14663) = 12600 numbers up to 14663 share no factor with it.
- 4
The digits of 14663 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14663 = 11 \times 31 \times 43 \]
14663 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16896 |
| Euler totient φ(n) | 12600 |
| Square | 215003569 |
| Cube | 3152597332247 |
| Square root | 121.090875 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4663 × |
14663 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and sixty-three |
| Binary (base 2) | 11100101000111 |
| Octal (base 8) | 34507 |
| Hexadecimal (base 16) | 3947 |
| Base 3 | 202010002 |
| As time | 14663 seconds = 4 h 4 min 23 s |
Is 14663 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 | No (remainder 5) | 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 2) | 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 | Yes (14663 ÷ 11 = 1333) | 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 14663 a prime number?
No. 14663 = 11 × 31 × 43, so it is divisible by 11.
What are the factors of 14663?
1, 11, 31, 43, 341, 473, 1333, 14663.
What is 14663 in binary?
11100101000111 (hexadecimal 3947, octal 34507).
What is the square root of 14663?
About 121.0909.
Is 14663 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14663?
It is a composite number with 8 divisors.