The number 93501
93501 is a composite number with 8 divisors. Its prime factorisation is × 3463. Divisors (8): 1, 3, 9, 27, 3463, 10389, 31167, 93501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93501 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93501 is composite. Its prime factorisation is
- 3
The divisors add up to 138560; without 93501 itself that is 45059, so 93501 is deficient (45059 is less than 93501). Euler's totient φ(93501) = 62316 numbers up to 93501 share no factor with it.
- 4
The digits of 93501 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93501 = 3^{3} \times 3463 \]93501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 138560 |
| Euler totient φ(n) | 62316 |
| Square | 8742437001 |
| Cube | 817426602030501 |
| Square root | 305.779332 (= 3√10389) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.3501 × |
93501 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand five hundred and one |
| Binary (base 2) | 10110110100111101 |
| Octal (base 8) | 266475 |
| Hexadecimal (base 16) | 16D3D |
| Base 3 | 11202021000 |
| As time | 93501 seconds = 25 h 58 min 21 s |
Is 93501 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 (93501 ÷ 3 = 31167) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93501 ÷ 9 = 10389) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93501 a prime number?
No. 93501 = × 3463, so it is divisible by 3.
What are the factors of 93501?
1, 3, 9, 27, 3463, 10389, 31167, 93501.
What is 93501 in binary?
10110110100111101 (hexadecimal 16D3D, octal 266475).
What is the square root of 93501?
About 305.7793, exactly 3√10389.
Is 93501 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 93501?
It is a composite number with 8 divisors.