The number 14991
14991 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 263. Divisors (8): 1, 3, 19, 57, 263, 789, 4997, 14991.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14991 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14991 is composite. Its prime factorisation is
- 3
The divisors add up to 21120; without 14991 itself that is 6129, so 14991 is deficient (6129 is less than 14991). Euler's totient φ(14991) = 9432 numbers up to 14991 share no factor with it.
- 4
The digits of 14991 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14991 = 3 \times 19 \times 263 \]
14991 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21120 |
| Euler totient φ(n) | 9432 |
| Square | 224730081 |
| Cube | 3368928644271 |
| Square root | 122.437739 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4991 × |
14991 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and ninety-one |
| Binary (base 2) | 11101010001111 |
| Octal (base 8) | 35217 |
| Hexadecimal (base 16) | 3A8F |
| Base 3 | 202120020 |
| As time | 14991 seconds = 4 h 9 min 51 s |
Is 14991 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 (14991 ÷ 3 = 4997) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | 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 14991 a prime number?
No. 14991 = 3 × 19 × 263, so it is divisible by 3.
What are the factors of 14991?
1, 3, 19, 57, 263, 789, 4997, 14991.
What is 14991 in binary?
11101010001111 (hexadecimal 3A8F, octal 35217).
What is the square root of 14991?
About 122.4377.
Is 14991 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 14991?
It is a composite number with 8 divisors.