The number 92066
92066 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 3541. Divisors (8): 1, 2, 13, 26, 3541, 7082, 46033, 92066.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92066 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92066 is composite. Its prime factorisation is
- 3
The divisors add up to 148764; without 92066 itself that is 56698, so 92066 is deficient (56698 is less than 92066). Euler's totient φ(92066) = 42480 numbers up to 92066 share no factor with it.
- 4
The digits of 92066 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92066 = 2 \times 13 \times 3541 \]
92066 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 148764 |
| Euler totient φ(n) | 42480 |
| Square | 8476148356 |
| Cube | 780365074543496 |
| Square root | 303.423796 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.2066 × |
92066 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and sixty-six |
| Binary (base 2) | 10110011110100010 |
| Octal (base 8) | 263642 |
| Hexadecimal (base 16) | 167A2 |
| Base 3 | 11200021212 |
| As time | 92066 seconds = 25 h 34 min 26 s |
Is 92066 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92066 ÷ 2 = 46033) | 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 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 2) | 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 92066 a prime number?
No. 92066 = 2 × 13 × 3541, so it is divisible by 2.
What are the factors of 92066?
1, 2, 13, 26, 3541, 7082, 46033, 92066.
What is 92066 in binary?
10110011110100010 (hexadecimal 167A2, octal 263642).
What is the square root of 92066?
About 303.4238.
Is 92066 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 92066?
It is a composite number with 8 divisors.