The number 93315
93315 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 6221. Divisors (8): 1, 3, 5, 15, 6221, 18663, 31105, 93315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93315 is composite. Its prime factorisation is
- 3
The divisors add up to 149328; without 93315 itself that is 56013, so 93315 is deficient (56013 is less than 93315). Euler's totient φ(93315) = 49760 numbers up to 93315 share no factor with it.
- 4
The digits of 93315 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93315 = 3 \times 5 \times 6221 \]
93315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 149328 |
| Euler totient φ(n) | 49760 |
| Square | 8707689225 |
| Cube | 812558020030875 |
| Square root | 305.475040 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3315 × |
93315 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand three hundred and fifteen |
| Binary (base 2) | 10110110010000011 |
| Octal (base 8) | 266203 |
| Hexadecimal (base 16) | 16C83 |
| Base 3 | 11202000010 |
| As time | 93315 seconds = 25 h 55 min 15 s |
Is 93315 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 (93315 ÷ 3 = 31105) | 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 | Yes (93315 ÷ 5 = 18663) | 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 3) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93315 a prime number?
No. 93315 = 3 × 5 × 6221, so it is divisible by 3.
What are the factors of 93315?
1, 3, 5, 15, 6221, 18663, 31105, 93315.
What is 93315 in binary?
10110110010000011 (hexadecimal 16C83, octal 266203).
What is the square root of 93315?
About 305.4750.
Is 93315 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 93315?
It is a composite number with 8 divisors.