The number 14301
14301 is a composite number with 12 divisors. Its prime factorisation is × 7 × 227. Divisors (12): 1, 3, 7, 9, 21, 63, 227, 681, 1589, 2043, 4767, 14301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14301: a Harshad number: divisible by its digit sum 9.
- 2
14301 is composite. Its prime factorisation is
- 3
The divisors add up to 23712; without 14301 itself that is 9411, so 14301 is deficient (9411 is less than 14301). Euler's totient φ(14301) = 8136 numbers up to 14301 share no factor with it.
- 4
The digits of 14301 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14301 = 3^{2} \times 7 \times 227 \]14301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 23712 |
| Euler totient φ(n) | 8136 |
| Square | 204518601 |
| Cube | 2924820512901 |
| Square root | 119.586789 (= 3√1589) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.4301 × |
14301 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and one |
| Binary (base 2) | 11011111011101 |
| Octal (base 8) | 33735 |
| Hexadecimal (base 16) | 37DD |
| Base 3 | 201121200 |
| As time | 14301 seconds = 3 h 58 min 21 s |
Is 14301 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 (14301 ÷ 3 = 4767) | 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 | Yes (14301 ÷ 7 = 2043) | 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 | Yes (14301 ÷ 9 = 1589) | 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 1) | 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 14301 a prime number?
No. 14301 = × 7 × 227, so it is divisible by 3.
What are the factors of 14301?
1, 3, 7, 9, 21, 63, 227, 681, 1589, 2043, 4767, 14301.
What is 14301 in binary?
11011111011101 (hexadecimal 37DD, octal 33735).
What is the square root of 14301?
About 119.5868, exactly 3√1589.
Is 14301 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 14301?
14301 is a Harshad number: divisible by its digit sum 9.