The number 94046
94046 is a composite number with 8 divisors. Its prime factorisation is 2 × 59 × 797. Divisors (8): 1, 2, 59, 118, 797, 1594, 47023, 94046.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94046 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94046 is composite. Its prime factorisation is
- 3
The divisors add up to 143640; without 94046 itself that is 49594, so 94046 is deficient (49594 is less than 94046). Euler's totient φ(94046) = 46168 numbers up to 94046 share no factor with it.
- 4
The digits of 94046 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94046 = 2 \times 59 \times 797 \]
94046 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 143640 |
| Euler totient φ(n) | 46168 |
| Square | 8844650116 |
| Cube | 831803964809336 |
| Square root | 306.669203 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.4046 × |
94046 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and forty-six |
| Binary (base 2) | 10110111101011110 |
| Octal (base 8) | 267536 |
| Hexadecimal (base 16) | 16F5E |
| Base 3 | 11210000012 |
| As time | 94046 seconds = 26 h 7 min 26 s |
Is 94046 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94046 ÷ 2 = 47023) | 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 1) | 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 1) | 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 6) | 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 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94046 a prime number?
No. 94046 = 2 × 59 × 797, so it is divisible by 2.
What are the factors of 94046?
1, 2, 59, 118, 797, 1594, 47023, 94046.
What is 94046 in binary?
10110111101011110 (hexadecimal 16F5E, octal 267536).
What is the square root of 94046?
About 306.6692.
Is 94046 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 94046?
It is a composite number with 8 divisors.