The number 14601
14601 is a composite number with 8 divisors. Its prime factorisation is 3 × 31 × 157. Divisors (8): 1, 3, 31, 93, 157, 471, 4867, 14601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14601 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14601 is composite. Its prime factorisation is
- 3
The divisors add up to 20224; without 14601 itself that is 5623, so 14601 is deficient (5623 is less than 14601). Euler's totient φ(14601) = 9360 numbers up to 14601 share no factor with it.
- 4
The digits of 14601 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14601 = 3 \times 31 \times 157 \]
14601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20224 |
| Euler totient φ(n) | 9360 |
| Square | 213189201 |
| Cube | 3112775523801 |
| Square root | 120.834598 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4601 × |
14601 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and one |
| Binary (base 2) | 11100100001001 |
| Octal (base 8) | 34411 |
| Hexadecimal (base 16) | 3909 |
| Base 3 | 202000210 |
| As time | 14601 seconds = 4 h 3 min 21 s |
Is 14601 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 (14601 ÷ 3 = 4867) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14601 a prime number?
No. 14601 = 3 × 31 × 157, so it is divisible by 3.
What are the factors of 14601?
1, 3, 31, 93, 157, 471, 4867, 14601.
What is 14601 in binary?
11100100001001 (hexadecimal 3909, octal 34411).
What is the square root of 14601?
About 120.8346.
Is 14601 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 14601?
It is a composite number with 8 divisors.