The number 96415
96415 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 1753. Divisors (8): 1, 5, 11, 55, 1753, 8765, 19283, 96415.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96415 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96415 is composite. Its prime factorisation is
- 3
The divisors add up to 126288; without 96415 itself that is 29873, so 96415 is deficient (29873 is less than 96415). Euler's totient φ(96415) = 70080 numbers up to 96415 share no factor with it.
- 4
The digits of 96415 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 252 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96415 = 5 \times 11 \times 1753 \]
96415 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 126288 |
| Euler totient φ(n) | 70080 |
| Square | 9295852225 |
| Cube | 896259592273375 |
| Square root | 310.507649 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 252 |
| Scientific notation | 9.6415 × |
96415 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and fifteen |
| Binary (base 2) | 10111100010011111 |
| Octal (base 8) | 274237 |
| Hexadecimal (base 16) | 1789F |
| Base 3 | 11220020221 |
| As time | 96415 seconds = 26 h 46 min 55 s |
Is 96415 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 | Yes (96415 ÷ 5 = 19283) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (96415 ÷ 11 = 8765) | 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 96415 a prime number?
No. 96415 = 5 × 11 × 1753, so it is divisible by 5.
What are the factors of 96415?
1, 5, 11, 55, 1753, 8765, 19283, 96415.
What is 96415 in binary?
10111100010011111 (hexadecimal 1789F, octal 274237).
What is the square root of 96415?
About 310.5076.
Is 96415 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 96415?
It is a composite number with 8 divisors.