The number 84951
84951 is a composite number with 6 divisors. Its prime factorisation is × 9439. Divisors (6): 1, 3, 9, 9439, 28317, 84951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
84951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
84951 is composite. Its prime factorisation is
- 3
The divisors add up to 122720; without 84951 itself that is 37769, so 84951 is deficient (37769 is less than 84951). Euler's totient φ(84951) = 56628 numbers up to 84951 share no factor with it.
- 4
The digits of 84951 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 257 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84951 = 3^{2} \times 9439 \]84951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 122720 |
| Euler totient φ(n) | 56628 |
| Square | 7216672401 |
| Cube | 613063537137351 |
| Square root | 291.463548 (= 3√9439) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 257 |
| Scientific notation | 8.4951 × |
84951 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand nine hundred and fifty-one |
| Binary (base 2) | 10100101111010111 |
| Octal (base 8) | 245727 |
| Hexadecimal (base 16) | 14BD7 |
| Base 3 | 11022112100 |
| As time | 84951 seconds = 23 h 35 min 51 s |
Is 84951 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 (84951 ÷ 3 = 28317) | 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 6) | 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 | Yes (84951 ÷ 9 = 9439) | 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 9) | 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 84951 a prime number?
No. 84951 = × 9439, so it is divisible by 3.
What are the factors of 84951?
1, 3, 9, 9439, 28317, 84951.
What is 84951 in binary?
10100101111010111 (hexadecimal 14BD7, octal 245727).
What is the square root of 84951?
About 291.4635, exactly 3√9439.
Is 84951 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 84951?
It is a composite number with 6 divisors.