The number 93801
93801 is a composite number with 4 divisors. Its prime factorisation is 3 × 31267. Divisors (4): 1, 3, 31267, 93801.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93801: a semiprime: 3 × 31267, the product of two primes.
- 2
93801 is composite. Its prime factorisation is
- 3
The divisors add up to 125072; without 93801 itself that is 31271, so 93801 is deficient (31271 is less than 93801). Euler's totient φ(93801) = 62532 numbers up to 93801 share no factor with it.
- 4
The digits of 93801 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93801 = 3 \times 31267 \]
93801 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 125072 |
| Euler totient φ(n) | 62532 |
| Square | 8798627601 |
| Cube | 825320067601401 |
| Square root | 306.269489 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.3801 × |
93801 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand eight hundred and one |
| Binary (base 2) | 10110111001101001 |
| Octal (base 8) | 267151 |
| Hexadecimal (base 16) | 16E69 |
| Base 3 | 11202200010 |
| As time | 93801 seconds = 26 h 3 min 21 s |
Is 93801 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 (93801 ÷ 3 = 31267) | 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 1) | 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 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 93801 a prime number?
No. 93801 = 3 × 31267, so it is divisible by 3.
What are the factors of 93801?
1, 3, 31267, 93801.
What is 93801 in binary?
10110111001101001 (hexadecimal 16E69, octal 267151).
What is the square root of 93801?
About 306.2695.
Is 93801 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 93801?
93801 is a semiprime: 3 × 31267, the product of two primes.