The number 84791
84791 is a composite number with 4 divisors. Its prime factorisation is 7 × 12113. Divisors (4): 1, 7, 12113, 84791.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 84791: a semiprime: 7 × 12113, the product of two primes.
- 2
84791 is composite. Its prime factorisation is
- 3
The divisors add up to 96912; without 84791 itself that is 12121, so 84791 is deficient (12121 is less than 84791). Euler's totient φ(84791) = 72672 numbers up to 84791 share no factor with it.
- 4
The digits of 84791 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84791 = 7 \times 12113 \]
84791 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96912 |
| Euler totient φ(n) | 72672 |
| Square | 7189513681 |
| Cube | 609606054525671 |
| Square root | 291.188942 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.4791 × |
84791 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand seven hundred and ninety-one |
| Binary (base 2) | 10100101100110111 |
| Octal (base 8) | 245467 |
| Hexadecimal (base 16) | 14B37 |
| Base 3 | 11022022102 |
| As time | 84791 seconds = 23 h 33 min 11 s |
Is 84791 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (84791 ÷ 7 = 12113) | 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 2) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 84791 a prime number?
No. 84791 = 7 × 12113, so it is divisible by 7.
What are the factors of 84791?
1, 7, 12113, 84791.
What is 84791 in binary?
10100101100110111 (hexadecimal 14B37, octal 245467).
What is the square root of 84791?
About 291.1889.
Is 84791 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 84791?
84791 is a semiprime: 7 × 12113, the product of two primes.