The number 93693
93693 is a composite number with 4 divisors. Its prime factorisation is 3 × 31231. Divisors (4): 1, 3, 31231, 93693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93693: a semiprime: 3 × 31231, the product of two primes.
- 2
93693 is composite. Its prime factorisation is
- 3
The divisors add up to 124928; without 93693 itself that is 31235, so 93693 is deficient (31235 is less than 93693). Euler's totient φ(93693) = 62460 numbers up to 93693 share no factor with it.
- 4
The digits of 93693 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93693 = 3 \times 31231 \]
93693 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 124928 |
| Euler totient φ(n) | 62460 |
| Square | 8778378249 |
| Cube | 822472593283557 |
| Square root | 306.093123 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3693 × |
93693 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and ninety-three |
| Binary (base 2) | 10110110111111101 |
| Octal (base 8) | 266775 |
| Hexadecimal (base 16) | 16DFD |
| Base 3 | 11202112010 |
| As time | 93693 seconds = 26 h 1 min 33 s |
Is 93693 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 (93693 ÷ 3 = 31231) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93693 a prime number?
No. 93693 = 3 × 31231, so it is divisible by 3.
What are the factors of 93693?
1, 3, 31231, 93693.
What is 93693 in binary?
10110110111111101 (hexadecimal 16DFD, octal 266775).
What is the square root of 93693?
About 306.0931.
Is 93693 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 93693?
93693 is a semiprime: 3 × 31231, the product of two primes.