The number 84691
84691 is the 8252nd prime number. Its only divisors are 1 and 84691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 84691: the 8252nd prime number.
- 2
84691 is prime, so its only factors are 1 and 84691. It is the 8252nd prime; the next prime is 84697 and the one before is 84673.
- 3
The divisors add up to 84692; without 84691 itself that is 1, so 84691 is deficient (1 is less than 84691). Euler's totient φ(84691) = 84690 numbers up to 84691 share no factor with it.
- 4
The digits of 84691 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
84691 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 84692 |
| Euler totient φ(n) | 84690 |
| Square | 7172565481 |
| Cube | 607451743151371 |
| Square root | 291.017182 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.4691 × |
84691 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand six hundred and ninety-one |
| Binary (base 2) | 10100101011010011 |
| Octal (base 8) | 245323 |
| Hexadecimal (base 16) | 14AD3 |
| Base 3 | 11022011201 |
| As time | 84691 seconds = 23 h 31 min 31 s |
Is 84691 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 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 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 2) | 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 84691 a prime number?
Yes. 84691 is divisible only by 1 and itself.
What are the factors of 84691?
1, 84691.
What is 84691 in binary?
10100101011010011 (hexadecimal 14AD3, octal 245323).
What is the square root of 84691?
About 291.0172.
Is 84691 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 84691?
84691 is the 8252nd prime number.