The number 96815
96815 is a composite number with 12 divisors. Its prime factorisation is 5 × × 67. Divisors (12): 1, 5, 17, 67, 85, 289, 335, 1139, 1445, 5695, 19363, 96815.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96815 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96815 is composite. Its prime factorisation is
- 3
The divisors add up to 125256; without 96815 itself that is 28441, so 96815 is deficient (28441 is less than 96815). Euler's totient φ(96815) = 71808 numbers up to 96815 share no factor with it.
- 4
The digits of 96815 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96815 = 5 \times 17^{2} \times 67 \]96815 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 125256 |
| Euler totient φ(n) | 71808 |
| Square | 9373144225 |
| Cube | 907460958143375 |
| Square root | 311.151089 (= 17√335) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.6815 × |
96815 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand eight hundred and fifteen |
| Binary (base 2) | 10111101000101111 |
| Octal (base 8) | 275057 |
| Hexadecimal (base 16) | 17A2F |
| Base 3 | 11220210202 |
| As time | 96815 seconds = 26 h 53 min 35 s |
Is 96815 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 2) | 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 (96815 ÷ 5 = 19363) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96815 a prime number?
No. 96815 = 5 × × 67, so it is divisible by 5.
What are the factors of 96815?
1, 5, 17, 67, 85, 289, 335, 1139, 1445, 5695, 19363, 96815.
What is 96815 in binary?
10111101000101111 (hexadecimal 17A2F, octal 275057).
What is the square root of 96815?
About 311.1511, exactly 17√335.
Is 96815 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 96815?
It is a composite number with 12 divisors.