The number 92093
92093 is a composite number with 8 divisors. Its prime factorisation is 19 × 37 × 131. Divisors (8): 1, 19, 37, 131, 703, 2489, 4847, 92093.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92093 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92093 is composite. Its prime factorisation is
- 3
The divisors add up to 100320; without 92093 itself that is 8227, so 92093 is deficient (8227 is less than 92093). Euler's totient φ(92093) = 84240 numbers up to 92093 share no factor with it.
- 4
The digits of 92093 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92093 = 19 \times 37 \times 131 \]
92093 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 100320 |
| Euler totient φ(n) | 84240 |
| Square | 8481120649 |
| Cube | 781051843928357 |
| Square root | 303.468285 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.2093 × |
92093 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and ninety-three |
| Binary (base 2) | 10110011110111101 |
| Octal (base 8) | 263675 |
| Hexadecimal (base 16) | 167BD |
| Base 3 | 11200022212 |
| As time | 92093 seconds = 25 h 34 min 53 s |
Is 92093 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 | No (remainder 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92093 a prime number?
No. 92093 = 19 × 37 × 131, so it is divisible by 19.
What are the factors of 92093?
1, 19, 37, 131, 703, 2489, 4847, 92093.
What is 92093 in binary?
10110011110111101 (hexadecimal 167BD, octal 263675).
What is the square root of 92093?
About 303.4683.
Is 92093 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 92093?
It is a composite number with 8 divisors.