The number 14691
14691 is a composite number with 8 divisors. Its prime factorisation is 3 × 59 × 83. Divisors (8): 1, 3, 59, 83, 177, 249, 4897, 14691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14691 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14691 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 14691 itself that is 5469, so 14691 is deficient (5469 is less than 14691). Euler's totient φ(14691) = 9512 numbers up to 14691 share no factor with it.
- 4
The digits of 14691 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14691 = 3 \times 59 \times 83 \]
14691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 9512 |
| Square | 215825481 |
| Cube | 3170692141371 |
| Square root | 121.206435 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4691 × |
14691 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and ninety-one |
| Binary (base 2) | 11100101100011 |
| Octal (base 8) | 34543 |
| Hexadecimal (base 16) | 3963 |
| Base 3 | 202011010 |
| As time | 14691 seconds = 4 h 4 min 51 s |
Is 14691 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 (14691 ÷ 3 = 4897) | 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 5) | 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 3) | 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 6) | 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 14691 a prime number?
No. 14691 = 3 × 59 × 83, so it is divisible by 3.
What are the factors of 14691?
1, 3, 59, 83, 177, 249, 4897, 14691.
What is 14691 in binary?
11100101100011 (hexadecimal 3963, octal 34543).
What is the square root of 14691?
About 121.2064.
Is 14691 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14691?
It is a composite number with 8 divisors.