The number 84051
84051 is a composite number with 16 divisors. Its prime factorisation is × 11 × 283. Divisors (16): 1, 3, 9, 11, 27, 33, 99, 283, 297, 849, 2547, 3113, 7641, 9339, 28017, 84051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
84051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
84051 is composite. Its prime factorisation is
- 3
The divisors add up to 136320; without 84051 itself that is 52269, so 84051 is deficient (52269 is less than 84051). Euler's totient φ(84051) = 50760 numbers up to 84051 share no factor with it.
- 4
The digits of 84051 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84051 = 3^{3} \times 11 \times 283 \]84051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 136320 |
| Euler totient φ(n) | 50760 |
| Square | 7064570601 |
| Cube | 593784223584651 |
| Square root | 289.915505 (= 3√9339) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 133 |
| Scientific notation | 8.4051 × |
84051 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand and fifty-one |
| Binary (base 2) | 10100100001010011 |
| Octal (base 8) | 244123 |
| Hexadecimal (base 16) | 14853 |
| Base 3 | 11021022000 |
| As time | 84051 seconds = 23 h 20 min 51 s |
Is 84051 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 (84051 ÷ 3 = 28017) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (84051 ÷ 9 = 9339) | 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 | Yes (84051 ÷ 11 = 7641) | 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 84051 a prime number?
No. 84051 = × 11 × 283, so it is divisible by 3.
What are the factors of 84051?
1, 3, 9, 11, 27, 33, 99, 283, 297, 849, 2547, 3113, 7641, 9339, 28017, 84051.
What is 84051 in binary?
10100100001010011 (hexadecimal 14853, octal 244123).
What is the square root of 84051?
About 289.9155, exactly 3√9339.
Is 84051 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 84051?
It is a composite number with 16 divisors.