The number 93962
93962 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 4271. Divisors (8): 1, 2, 11, 22, 4271, 8542, 46981, 93962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93962 is composite. Its prime factorisation is
- 3
The divisors add up to 153792; without 93962 itself that is 59830, so 93962 is deficient (59830 is less than 93962). Euler's totient φ(93962) = 42700 numbers up to 93962 share no factor with it.
- 4
The digits of 93962 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93962 = 2 \times 11 \times 4271 \]
93962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 153792 |
| Euler totient φ(n) | 42700 |
| Square | 8828857444 |
| Cube | 829577103153128 |
| Square root | 306.532217 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3962 × |
93962 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and sixty-two |
| Binary (base 2) | 10110111100001010 |
| Octal (base 8) | 267412 |
| Hexadecimal (base 16) | 16F0A |
| Base 3 | 11202220002 |
| As time | 93962 seconds = 26 h 6 min 2 s |
Is 93962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93962 ÷ 2 = 46981) | 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 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | Yes (93962 ÷ 11 = 8542) | 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 93962 a prime number?
No. 93962 = 2 × 11 × 4271, so it is divisible by 2.
What are the factors of 93962?
1, 2, 11, 22, 4271, 8542, 46981, 93962.
What is 93962 in binary?
10110111100001010 (hexadecimal 16F0A, octal 267412).
What is the square root of 93962?
About 306.5322.
Is 93962 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 93962?
It is a composite number with 8 divisors.