The number 92012
92012 is a composite number with 6 divisors. Its prime factorisation is × 23003. Divisors (6): 1, 2, 4, 23003, 46006, 92012.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92012 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92012 is composite. Its prime factorisation is
- 3
The divisors add up to 161028; without 92012 itself that is 69016, so 92012 is deficient (69016 is less than 92012). Euler's totient φ(92012) = 46004 numbers up to 92012 share no factor with it.
- 4
The digits of 92012 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92012 = 2^{2} \times 23003 \]92012 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 161028 |
| Euler totient φ(n) | 46004 |
| Square | 8466208144 |
| Cube | 778992743745728 |
| Square root | 303.334799 (= 2√23003) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.2012 × |
92012 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and twelve |
| Binary (base 2) | 10110011101101100 |
| Octal (base 8) | 263554 |
| Hexadecimal (base 16) | 1676C |
| Base 3 | 11200012212 |
| As time | 92012 seconds = 25 h 33 min 32 s |
Is 92012 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92012 ÷ 2 = 46006) | 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 | Yes (92012 ÷ 4 = 23003) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92012 a prime number?
No. 92012 = × 23003, so it is divisible by 2.
What are the factors of 92012?
1, 2, 4, 23003, 46006, 92012.
What is 92012 in binary?
10110011101101100 (hexadecimal 1676C, octal 263554).
What is the square root of 92012?
About 303.3348, exactly 2√23003.
Is 92012 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 92012?
It is a composite number with 6 divisors.