The number 93932
93932 is a composite number with 12 divisors. Its prime factorisation is × 23 × 1021. Divisors (12): 1, 2, 4, 23, 46, 92, 1021, 2042, 4084, 23483, 46966, 93932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93932 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93932 is composite. Its prime factorisation is
- 3
The divisors add up to 171696; without 93932 itself that is 77764, so 93932 is deficient (77764 is less than 93932). Euler's totient φ(93932) = 44880 numbers up to 93932 share no factor with it.
- 4
The digits of 93932 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93932 = 2^{2} \times 23 \times 1021 \]93932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 171696 |
| Euler totient φ(n) | 44880 |
| Square | 8823220624 |
| Cube | 828782759653568 |
| Square root | 306.483278 (= 2√23483) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.3932 × |
93932 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and thirty-two |
| Binary (base 2) | 10110111011101100 |
| Octal (base 8) | 267354 |
| Hexadecimal (base 16) | 16EEC |
| Base 3 | 11202211222 |
| As time | 93932 seconds = 26 h 5 min 32 s |
Is 93932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93932 ÷ 2 = 46966) | 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 (93932 ÷ 4 = 23483) | 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 6) | 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 8) | 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 3) | 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 93932 a prime number?
No. 93932 = × 23 × 1021, so it is divisible by 2.
What are the factors of 93932?
1, 2, 4, 23, 46, 92, 1021, 2042, 4084, 23483, 46966, 93932.
What is 93932 in binary?
10110111011101100 (hexadecimal 16EEC, octal 267354).
What is the square root of 93932?
About 306.4833, exactly 2√23483.
Is 93932 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 93932?
It is a composite number with 12 divisors.