The number 14791
14791 is a composite number with 4 divisors. Its prime factorisation is 7 × 2113. Divisors (4): 1, 7, 2113, 14791.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14791: a semiprime: 7 × 2113, the product of two primes.
- 2
14791 is composite. Its prime factorisation is
- 3
The divisors add up to 16912; without 14791 itself that is 2121, so 14791 is deficient (2121 is less than 14791). Euler's totient φ(14791) = 12672 numbers up to 14791 share no factor with it.
- 4
The digits of 14791 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14791 = 7 \times 2113 \]
14791 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16912 |
| Euler totient φ(n) | 12672 |
| Square | 218773681 |
| Cube | 3235881515671 |
| Square root | 121.618255 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4791 × |
14791 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and ninety-one |
| Binary (base 2) | 11100111000111 |
| Octal (base 8) | 34707 |
| Hexadecimal (base 16) | 39C7 |
| Base 3 | 202021211 |
| As time | 14791 seconds = 4 h 6 min 31 s |
Is 14791 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 | Yes (14791 ÷ 7 = 2113) | 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 4) | 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 7) | 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 14791 a prime number?
No. 14791 = 7 × 2113, so it is divisible by 7.
What are the factors of 14791?
1, 7, 2113, 14791.
What is 14791 in binary?
11100111000111 (hexadecimal 39C7, octal 34707).
What is the square root of 14791?
About 121.6183.
Is 14791 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14791?
14791 is a semiprime: 7 × 2113, the product of two primes.