The number 93631
93631 is a composite number with 4 divisors. Its prime factorisation is 109 × 859. Divisors (4): 1, 109, 859, 93631.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93631: a semiprime: 109 × 859, the product of two primes.
- 2
93631 is composite. Its prime factorisation is
- 3
The divisors add up to 94600; without 93631 itself that is 969, so 93631 is deficient (969 is less than 93631). Euler's totient φ(93631) = 92664 numbers up to 93631 share no factor with it.
- 4
The digits of 93631 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93631 = 109 \times 859 \]
93631 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 94600 |
| Euler totient φ(n) | 92664 |
| Square | 8766764161 |
| Cube | 820840895158591 |
| Square root | 305.991830 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3631 × |
93631 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and thirty-one |
| Binary (base 2) | 10110110110111111 |
| Octal (base 8) | 266677 |
| Hexadecimal (base 16) | 16DBF |
| Base 3 | 11202102211 |
| As time | 93631 seconds = 26 h 0 min 31 s |
Is 93631 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 | No (remainder 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93631 a prime number?
No. 93631 = 109 × 859, so it is divisible by 109.
What are the factors of 93631?
1, 109, 859, 93631.
What is 93631 in binary?
10110110110111111 (hexadecimal 16DBF, octal 266677).
What is the square root of 93631?
About 305.9918.
Is 93631 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 93631?
93631 is a semiprime: 109 × 859, the product of two primes.