The number 84695
84695 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 1303. Divisors (8): 1, 5, 13, 65, 1303, 6515, 16939, 84695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
84695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
84695 is composite. Its prime factorisation is
- 3
The divisors add up to 109536; without 84695 itself that is 24841, so 84695 is deficient (24841 is less than 84695). Euler's totient φ(84695) = 62496 numbers up to 84695 share no factor with it.
- 4
The digits of 84695 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84695 = 5 \times 13 \times 1303 \]
84695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 109536 |
| Euler totient φ(n) | 62496 |
| Square | 7173243025 |
| Cube | 607537818002375 |
| Square root | 291.024054 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.4695 × |
84695 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand six hundred and ninety-five |
| Binary (base 2) | 10100101011010111 |
| Octal (base 8) | 245327 |
| Hexadecimal (base 16) | 14AD7 |
| Base 3 | 11022011212 |
| As time | 84695 seconds = 23 h 31 min 35 s |
Is 84695 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 | Yes (84695 ÷ 5 = 16939) | 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 | No (remainder 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 84695 a prime number?
No. 84695 = 5 × 13 × 1303, so it is divisible by 5.
What are the factors of 84695?
1, 5, 13, 65, 1303, 6515, 16939, 84695.
What is 84695 in binary?
10100101011010111 (hexadecimal 14AD7, octal 245327).
What is the square root of 84695?
About 291.0241.
Is 84695 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 84695?
It is a composite number with 8 divisors.