The number 93922
93922 is a composite number with 8 divisors. Its prime factorisation is 2 × 151 × 311. Divisors (8): 1, 2, 151, 302, 311, 622, 46961, 93922.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93922 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93922 is composite. Its prime factorisation is
- 3
The divisors add up to 142272; without 93922 itself that is 48350, so 93922 is deficient (48350 is less than 93922). Euler's totient φ(93922) = 46500 numbers up to 93922 share no factor with it.
- 4
The digits of 93922 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93922 = 2 \times 151 \times 311 \]
93922 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 142272 |
| Euler totient φ(n) | 46500 |
| Square | 8821342084 |
| Cube | 828518091213448 |
| Square root | 306.466964 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3922 × |
93922 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and twenty-two |
| Binary (base 2) | 10110111011100010 |
| Octal (base 8) | 267342 |
| Hexadecimal (base 16) | 16EE2 |
| Base 3 | 11202211121 |
| As time | 93922 seconds = 26 h 5 min 22 s |
Is 93922 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93922 ÷ 2 = 46961) | 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 | No (remainder 2) | 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 3) | 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 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93922 a prime number?
No. 93922 = 2 × 151 × 311, so it is divisible by 2.
What are the factors of 93922?
1, 2, 151, 302, 311, 622, 46961, 93922.
What is 93922 in binary?
10110111011100010 (hexadecimal 16EE2, octal 267342).
What is the square root of 93922?
About 306.4670.
Is 93922 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 93922?
It is a composite number with 8 divisors.