The number 94048
94048 is a composite number with 12 divisors. Its prime factorisation is × 2939. Divisors (12): 1, 2, 4, 8, 16, 32, 2939, 5878, 11756, 23512, 47024, 94048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94048 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94048 is composite. Its prime factorisation is
- 3
The divisors add up to 185220; without 94048 itself that is 91172, so 94048 is deficient (91172 is less than 94048). Euler's totient φ(94048) = 47008 numbers up to 94048 share no factor with it.
- 4
The digits of 94048 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94048 = 2^{5} \times 2939 \]94048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 185220 |
| Euler totient φ(n) | 47008 |
| Square | 8845026304 |
| Cube | 831857033838592 |
| Square root | 306.672464 (= 4√5878) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.4048 × |
94048 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and forty-eight |
| Binary (base 2) | 10110111101100000 |
| Octal (base 8) | 267540 |
| Hexadecimal (base 16) | 16F60 |
| Base 3 | 11210000021 |
| As time | 94048 seconds = 26 h 7 min 28 s |
Is 94048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94048 ÷ 2 = 47024) | 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 | Yes (94048 ÷ 4 = 23512) | 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 3) | 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 | Yes (94048 ÷ 8 = 11756) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94048 a prime number?
No. 94048 = × 2939, so it is divisible by 2.
What are the factors of 94048?
1, 2, 4, 8, 16, 32, 2939, 5878, 11756, 23512, 47024, 94048.
What is 94048 in binary?
10110111101100000 (hexadecimal 16F60, octal 267540).
What is the square root of 94048?
About 306.6725, exactly 4√5878.
Is 94048 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 94048?
It is a composite number with 12 divisors.