The number 14501
14501 is a composite number with 4 divisors. Its prime factorisation is 17 × 853. Divisors (4): 1, 17, 853, 14501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14501: a semiprime: 17 × 853, the product of two primes.
- 2
14501 is composite. Its prime factorisation is
- 3
The divisors add up to 15372; without 14501 itself that is 871, so 14501 is deficient (871 is less than 14501). Euler's totient φ(14501) = 13632 numbers up to 14501 share no factor with it.
- 4
The digits of 14501 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14501 = 17 \times 853 \]
14501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15372 |
| Euler totient φ(n) | 13632 |
| Square | 210279001 |
| Cube | 3049255793501 |
| Square root | 120.420098 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4501 × |
14501 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and one |
| Binary (base 2) | 11100010100101 |
| Octal (base 8) | 34245 |
| Hexadecimal (base 16) | 38A5 |
| Base 3 | 201220002 |
| As time | 14501 seconds = 4 h 1 min 41 s |
Is 14501 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 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 5) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14501 a prime number?
No. 14501 = 17 × 853, so it is divisible by 17.
What are the factors of 14501?
1, 17, 853, 14501.
What is 14501 in binary?
11100010100101 (hexadecimal 38A5, octal 34245).
What is the square root of 14501?
About 120.4201.
Is 14501 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 14501?
14501 is a semiprime: 17 × 853, the product of two primes.