The number 14391
14391 is a composite number with 16 divisors. Its prime factorisation is × 13 × 41. Divisors (16): 1, 3, 9, 13, 27, 39, 41, 117, 123, 351, 369, 533, 1107, 1599, 4797, 14391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14391 is composite. Its prime factorisation is
- 3
The divisors add up to 23520; without 14391 itself that is 9129, so 14391 is deficient (9129 is less than 14391). Euler's totient φ(14391) = 8640 numbers up to 14391 share no factor with it.
- 4
The digits of 14391 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14391 = 3^{3} \times 13 \times 41 \]14391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 23520 |
| Euler totient φ(n) | 8640 |
| Square | 207100881 |
| Cube | 2980388778471 |
| Square root | 119.962494 (= 3√1599) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.4391 × |
14391 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and ninety-one |
| Binary (base 2) | 11100000110111 |
| Octal (base 8) | 34067 |
| Hexadecimal (base 16) | 3837 |
| Base 3 | 201202000 |
| As time | 14391 seconds = 3 h 59 min 51 s |
Is 14391 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 (14391 ÷ 3 = 4797) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14391 ÷ 9 = 1599) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14391 a prime number?
No. 14391 = × 13 × 41, so it is divisible by 3.
What are the factors of 14391?
1, 3, 9, 13, 27, 39, 41, 117, 123, 351, 369, 533, 1107, 1599, 4797, 14391.
What is 14391 in binary?
11100000110111 (hexadecimal 3837, octal 34067).
What is the square root of 14391?
About 119.9625, exactly 3√1599.
Is 14391 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14391?
It is a composite number with 16 divisors.