The number 94012
94012 is a composite number with 12 divisors. Its prime factorisation is × 19 × 1237. Divisors (12): 1, 2, 4, 19, 38, 76, 1237, 2474, 4948, 23503, 47006, 94012.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94012 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94012 is composite. Its prime factorisation is
- 3
The divisors add up to 173320; without 94012 itself that is 79308, so 94012 is deficient (79308 is less than 94012). Euler's totient φ(94012) = 44496 numbers up to 94012 share no factor with it.
- 4
The digits of 94012 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94012 = 2^{2} \times 19 \times 1237 \]94012 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 173320 |
| Euler totient φ(n) | 44496 |
| Square | 8838256144 |
| Cube | 830902136609728 |
| Square root | 306.613764 (= 2√23503) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.4012 × |
94012 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and twelve |
| Binary (base 2) | 10110111100111100 |
| Octal (base 8) | 267474 |
| Hexadecimal (base 16) | 16F3C |
| Base 3 | 11202221221 |
| As time | 94012 seconds = 26 h 6 min 52 s |
Is 94012 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94012 ÷ 2 = 47006) | 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 (94012 ÷ 4 = 23503) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 94012 a prime number?
No. 94012 = × 19 × 1237, so it is divisible by 2.
What are the factors of 94012?
1, 2, 4, 19, 38, 76, 1237, 2474, 4948, 23503, 47006, 94012.
What is 94012 in binary?
10110111100111100 (hexadecimal 16F3C, octal 267474).
What is the square root of 94012?
About 306.6138, exactly 2√23503.
Is 94012 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 94012?
It is a composite number with 12 divisors.