The number 93963
93963 is a composite number with 4 divisors. Its prime factorisation is 3 × 31321. Divisors (4): 1, 3, 31321, 93963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93963: a semiprime: 3 × 31321, the product of two primes.
- 2
93963 is composite. Its prime factorisation is
- 3
The divisors add up to 125288; without 93963 itself that is 31325, so 93963 is deficient (31325 is less than 93963). Euler's totient φ(93963) = 62640 numbers up to 93963 share no factor with it.
- 4
The digits of 93963 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93963 = 3 \times 31321 \]
93963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 125288 |
| Euler totient φ(n) | 62640 |
| Square | 8829045369 |
| Cube | 829603590007347 |
| Square root | 306.533848 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.3963 × |
93963 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and sixty-three |
| Binary (base 2) | 10110111100001011 |
| Octal (base 8) | 267413 |
| Hexadecimal (base 16) | 16F0B |
| Base 3 | 11202220010 |
| As time | 93963 seconds = 26 h 6 min 3 s |
Is 93963 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 (93963 ÷ 3 = 31321) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93963 a prime number?
No. 93963 = 3 × 31321, so it is divisible by 3.
What are the factors of 93963?
1, 3, 31321, 93963.
What is 93963 in binary?
10110111100001011 (hexadecimal 16F0B, octal 267413).
What is the square root of 93963?
About 306.5338.
Is 93963 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 93963?
93963 is a semiprime: 3 × 31321, the product of two primes.