The number 94058
94058 is a composite number with 8 divisors. Its prime factorisation is 2 × 131 × 359. Divisors (8): 1, 2, 131, 262, 359, 718, 47029, 94058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94058 is composite. Its prime factorisation is
- 3
The divisors add up to 142560; without 94058 itself that is 48502, so 94058 is deficient (48502 is less than 94058). Euler's totient φ(94058) = 46540 numbers up to 94058 share no factor with it.
- 4
The digits of 94058 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94058 = 2 \times 131 \times 359 \]
94058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 142560 |
| Euler totient φ(n) | 46540 |
| Square | 8846907364 |
| Cube | 832122412843112 |
| Square root | 306.688767 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.4058 × |
94058 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and fifty-eight |
| Binary (base 2) | 10110111101101010 |
| Octal (base 8) | 267552 |
| Hexadecimal (base 16) | 16F6A |
| Base 3 | 11210000122 |
| As time | 94058 seconds = 26 h 7 min 38 s |
Is 94058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94058 ÷ 2 = 47029) | 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 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94058 a prime number?
No. 94058 = 2 × 131 × 359, so it is divisible by 2.
What are the factors of 94058?
1, 2, 131, 262, 359, 718, 47029, 94058.
What is 94058 in binary?
10110111101101010 (hexadecimal 16F6A, octal 267552).
What is the square root of 94058?
About 306.6888.
Is 94058 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 94058?
It is a composite number with 8 divisors.