The number 93391
93391 is a composite number with 4 divisors. Its prime factorisation is 61 × 1531. Divisors (4): 1, 61, 1531, 93391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93391: a semiprime: 61 × 1531, the product of two primes.
- 2
93391 is composite. Its prime factorisation is
- 3
The divisors add up to 94984; without 93391 itself that is 1593, so 93391 is deficient (1593 is less than 93391). Euler's totient φ(93391) = 91800 numbers up to 93391 share no factor with it.
- 4
The digits of 93391 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93391 = 61 \times 1531 \]
93391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 94984 |
| Euler totient φ(n) | 91800 |
| Square | 8721878881 |
| Cube | 814544990575471 |
| Square root | 305.599411 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.3391 × |
93391 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand three hundred and ninety-one |
| Binary (base 2) | 10110110011001111 |
| Octal (base 8) | 266317 |
| Hexadecimal (base 16) | 16CCF |
| Base 3 | 11202002221 |
| As time | 93391 seconds = 25 h 56 min 31 s |
Is 93391 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 4) | 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 7) | 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 1) | 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 93391 a prime number?
No. 93391 = 61 × 1531, so it is divisible by 61.
What are the factors of 93391?
1, 61, 1531, 93391.
What is 93391 in binary?
10110110011001111 (hexadecimal 16CCF, octal 266317).
What is the square root of 93391?
About 305.5994.
Is 93391 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 93391?
93391 is a semiprime: 61 × 1531, the product of two primes.