The number 96411
96411 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 4591. Divisors (8): 1, 3, 7, 21, 4591, 13773, 32137, 96411.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96411: a Harshad number: divisible by its digit sum 21.
- 2
96411 is composite. Its prime factorisation is
- 3
The divisors add up to 146944; without 96411 itself that is 50533, so 96411 is deficient (50533 is less than 96411). Euler's totient φ(96411) = 55080 numbers up to 96411 share no factor with it.
- 4
The digits of 96411 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96411 = 3 \times 7 \times 4591 \]
96411 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 146944 |
| Euler totient φ(n) | 55080 |
| Square | 9295080921 |
| Cube | 896148046674531 |
| Square root | 310.501208 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.6411 × |
96411 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and eleven |
| Binary (base 2) | 10111100010011011 |
| Octal (base 8) | 274233 |
| Hexadecimal (base 16) | 1789B |
| Base 3 | 11220020210 |
| As time | 96411 seconds = 26 h 46 min 51 s |
Is 96411 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 (96411 ÷ 3 = 32137) | 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 | 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 | Yes (96411 ÷ 7 = 13773) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 96411 a prime number?
No. 96411 = 3 × 7 × 4591, so it is divisible by 3.
What are the factors of 96411?
1, 3, 7, 21, 4591, 13773, 32137, 96411.
What is 96411 in binary?
10111100010011011 (hexadecimal 1789B, octal 274233).
What is the square root of 96411?
About 310.5012.
Is 96411 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 96411?
96411 is a Harshad number: divisible by its digit sum 21.