The number 92061
92061 is a composite number with 12 divisors. Its prime factorisation is × 53 × 193. Divisors (12): 1, 3, 9, 53, 159, 193, 477, 579, 1737, 10229, 30687, 92061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92061 is composite. Its prime factorisation is
- 3
The divisors add up to 136188; without 92061 itself that is 44127, so 92061 is deficient (44127 is less than 92061). Euler's totient φ(92061) = 59904 numbers up to 92061 share no factor with it.
- 4
The digits of 92061 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92061 = 3^{2} \times 53 \times 193 \]92061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 136188 |
| Euler totient φ(n) | 59904 |
| Square | 8475227721 |
| Cube | 780237939222981 |
| Square root | 303.415557 (= 3√10229) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.2061 × |
92061 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and sixty-one |
| Binary (base 2) | 10110011110011101 |
| Octal (base 8) | 263635 |
| Hexadecimal (base 16) | 1679D |
| Base 3 | 11200021200 |
| As time | 92061 seconds = 25 h 34 min 21 s |
Is 92061 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (92061 ÷ 3 = 30687) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (92061 ÷ 9 = 10229) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92061 a prime number?
No. 92061 = × 53 × 193, so it is divisible by 3.
What are the factors of 92061?
1, 3, 9, 53, 159, 193, 477, 579, 1737, 10229, 30687, 92061.
What is 92061 in binary?
10110011110011101 (hexadecimal 1679D, octal 263635).
What is the square root of 92061?
About 303.4156, exactly 3√10229.
Is 92061 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 92061?
It is a composite number with 12 divisors.