The number 84058
84058 is a composite number with 16 divisors. Its prime factorisation is 2 × 13 × 53 × 61. Divisors (16): 1, 2, 13, 26, 53, 61, 106, 122, 689, 793, 1378, 1586, 3233, 6466, 42029, 84058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
84058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
84058 is composite. Its prime factorisation is
- 3
The divisors add up to 140616; without 84058 itself that is 56558, so 84058 is deficient (56558 is less than 84058). Euler's totient φ(84058) = 37440 numbers up to 84058 share no factor with it.
- 4
The digits of 84058 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84058 = 2 \times 13 \times 53 \times 61 \]
84058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 140616 |
| Euler totient φ(n) | 37440 |
| Square | 7065747364 |
| Cube | 593932591923112 |
| Square root | 289.927577 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.4058 × |
84058 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand and fifty-eight |
| Binary (base 2) | 10100100001011010 |
| Octal (base 8) | 244132 |
| Hexadecimal (base 16) | 1485A |
| Base 3 | 11021022021 |
| As time | 84058 seconds = 23 h 20 min 58 s |
Is 84058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (84058 ÷ 2 = 42029) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 84058 a prime number?
No. 84058 = 2 × 13 × 53 × 61, so it is divisible by 2.
What are the factors of 84058?
1, 2, 13, 26, 53, 61, 106, 122, 689, 793, 1378, 1586, 3233, 6466, 42029, 84058.
What is 84058 in binary?
10100100001011010 (hexadecimal 1485A, octal 244132).
What is the square root of 84058?
About 289.9276.
Is 84058 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 84058?
It is a composite number with 16 divisors.