The number 14606
14606 is a composite number with 8 divisors. Its prime factorisation is 2 × 67 × 109. Divisors (8): 1, 2, 67, 109, 134, 218, 7303, 14606.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14606 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14606 is composite. Its prime factorisation is
- 3
The divisors add up to 22440; without 14606 itself that is 7834, so 14606 is deficient (7834 is less than 14606). Euler's totient φ(14606) = 7128 numbers up to 14606 share no factor with it.
- 4
The digits of 14606 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14606 = 2 \times 67 \times 109 \]
14606 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22440 |
| Euler totient φ(n) | 7128 |
| Square | 213335236 |
| Cube | 3115974457016 |
| Square root | 120.855285 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4606 × |
14606 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and six |
| Binary (base 2) | 11100100001110 |
| Octal (base 8) | 34416 |
| Hexadecimal (base 16) | 390E |
| Base 3 | 202000222 |
| As time | 14606 seconds = 4 h 3 min 26 s |
Is 14606 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14606 ÷ 2 = 7303) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14606 a prime number?
No. 14606 = 2 × 67 × 109, so it is divisible by 2.
What are the factors of 14606?
1, 2, 67, 109, 134, 218, 7303, 14606.
What is 14606 in binary?
11100100001110 (hexadecimal 390E, octal 34416).
What is the square root of 14606?
About 120.8553.
Is 14606 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14606?
It is a composite number with 8 divisors.