The number 14638
14638 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 563. Divisors (8): 1, 2, 13, 26, 563, 1126, 7319, 14638.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14638 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14638 is composite. Its prime factorisation is
- 3
The divisors add up to 23688; without 14638 itself that is 9050, so 14638 is deficient (9050 is less than 14638). Euler's totient φ(14638) = 6744 numbers up to 14638 share no factor with it.
- 4
The digits of 14638 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14638 = 2 \times 13 \times 563 \]
14638 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23688 |
| Euler totient φ(n) | 6744 |
| Square | 214271044 |
| Cube | 3136499542072 |
| Square root | 120.987603 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4638 × |
14638 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and thirty-eight |
| Binary (base 2) | 11100100101110 |
| Octal (base 8) | 34456 |
| Hexadecimal (base 16) | 392E |
| Base 3 | 202002011 |
| As time | 14638 seconds = 4 h 3 min 58 s |
Is 14638 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14638 ÷ 2 = 7319) | 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 2) | 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 4) | 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 6) | 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 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14638 a prime number?
No. 14638 = 2 × 13 × 563, so it is divisible by 2.
What are the factors of 14638?
1, 2, 13, 26, 563, 1126, 7319, 14638.
What is 14638 in binary?
11100100101110 (hexadecimal 392E, octal 34456).
What is the square root of 14638?
About 120.9876.
Is 14638 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14638?
It is a composite number with 8 divisors.