The number 96417
96417 is a composite number with 8 divisors. Its prime factorisation is × 3571. Divisors (8): 1, 3, 9, 27, 3571, 10713, 32139, 96417.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96417: a Harshad number: divisible by its digit sum 27.
- 2
96417 is composite. Its prime factorisation is
- 3
The divisors add up to 142880; without 96417 itself that is 46463, so 96417 is deficient (46463 is less than 96417). Euler's totient φ(96417) = 64260 numbers up to 96417 share no factor with it.
- 4
The digits of 96417 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96417 = 3^{3} \times 3571 \]96417 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 142880 |
| Euler totient φ(n) | 64260 |
| Square | 9296237889 |
| Cube | 896315368543713 |
| Square root | 310.510869 (= 3√10713) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.6417 × |
96417 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and seventeen |
| Binary (base 2) | 10111100010100001 |
| Octal (base 8) | 274241 |
| Hexadecimal (base 16) | 178A1 |
| Base 3 | 11220021000 |
| As time | 96417 seconds = 26 h 46 min 57 s |
Is 96417 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 (96417 ÷ 3 = 32139) | 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 2) | 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 6) | 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 | Yes (96417 ÷ 9 = 10713) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96417 a prime number?
No. 96417 = × 3571, so it is divisible by 3.
What are the factors of 96417?
1, 3, 9, 27, 3571, 10713, 32139, 96417.
What is 96417 in binary?
10111100010100001 (hexadecimal 178A1, octal 274241).
What is the square root of 96417?
About 310.5109, exactly 3√10713.
Is 96417 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 96417?
96417 is a Harshad number: divisible by its digit sum 27.