The number 14608
14608 is a composite number with 20 divisors. Its prime factorisation is × 11 × 83. Divisors (20): 1, 2, 4, 8, 11, 16, 22, 44, 83, 88, 166, 176, 332, 664, 913, 1328 … 14608.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14608 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14608 is composite. Its prime factorisation is
- 3
The divisors add up to 31248; without 14608 itself that is 16640, so 14608 is abundant (16640 is more than 14608). Euler's totient φ(14608) = 6560 numbers up to 14608 share no factor with it.
- 4
The digits of 14608 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14608 = 2^{4} \times 11 \times 83 \]14608 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 31248 |
| Euler totient φ(n) | 6560 |
| Square | 213393664 |
| Cube | 3117254643712 |
| Square root | 120.863559 (= 4√913) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4608 × |
14608 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and eight |
| Binary (base 2) | 11100100010000 |
| Octal (base 8) | 34420 |
| Hexadecimal (base 16) | 3910 |
| Base 3 | 202001001 |
| As time | 14608 seconds = 4 h 3 min 28 s |
Is 14608 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14608 ÷ 2 = 7304) | 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 | Yes (14608 ÷ 4 = 3652) | 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 6) | 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 | Yes (14608 ÷ 8 = 1826) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 | Yes (14608 ÷ 11 = 1328) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14608 a prime number?
No. 14608 = × 11 × 83, so it is divisible by 2.
What are the factors of 14608?
1, 2, 4, 8, 11, 16, 22, 44, 83, 88, 166, 176, 332, 664, 913, 1328, 1826, 3652, 7304, 14608.
What is 14608 in binary?
11100100010000 (hexadecimal 3910, octal 34420).
What is the square root of 14608?
About 120.8636, exactly 4√913.
Is 14608 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14608?
It is a composite number with 20 divisors.