The number 14491
14491 is a composite number with 4 divisors. Its prime factorisation is 43 × 337. Divisors (4): 1, 43, 337, 14491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14491: a semiprime: 43 × 337, the product of two primes.
- 2
14491 is composite. Its prime factorisation is
- 3
The divisors add up to 14872; without 14491 itself that is 381, so 14491 is deficient (381 is less than 14491). Euler's totient φ(14491) = 14112 numbers up to 14491 share no factor with it.
- 4
The digits of 14491 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14491 = 43 \times 337 \]
14491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14872 |
| Euler totient φ(n) | 14112 |
| Square | 209989081 |
| Cube | 3042951772771 |
| Square root | 120.378570 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4491 × |
14491 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and ninety-one |
| Binary (base 2) | 11100010011011 |
| Octal (base 8) | 34233 |
| Hexadecimal (base 16) | 389B |
| Base 3 | 201212201 |
| As time | 14491 seconds = 4 h 1 min 31 s |
Is 14491 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14491 a prime number?
No. 14491 = 43 × 337, so it is divisible by 43.
What are the factors of 14491?
1, 43, 337, 14491.
What is 14491 in binary?
11100010011011 (hexadecimal 389B, octal 34233).
What is the square root of 14491?
About 120.3786.
Is 14491 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14491?
14491 is a semiprime: 43 × 337, the product of two primes.