The number 96410
96410 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 31 × 311. Divisors (16): 1, 2, 5, 10, 31, 62, 155, 310, 311, 622, 1555, 3110, 9641, 19282, 48205, 96410.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96410 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96410 is composite. Its prime factorisation is
- 3
The divisors add up to 179712; without 96410 itself that is 83302, so 96410 is deficient (83302 is less than 96410). Euler's totient φ(96410) = 37200 numbers up to 96410 share no factor with it.
- 4
The digits of 96410 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96410 = 2 \times 5 \times 31 \times 311 \]
96410 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 179712 |
| Euler totient φ(n) | 37200 |
| Square | 9294888100 |
| Cube | 896120161721000 |
| Square root | 310.499597 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.641 × |
96410 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and ten |
| Binary (base 2) | 10111100010011010 |
| Octal (base 8) | 274232 |
| Hexadecimal (base 16) | 1789A |
| Base 3 | 11220020202 |
| As time | 96410 seconds = 26 h 46 min 50 s |
Is 96410 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (96410 ÷ 2 = 48205) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (96410 ÷ 5 = 19282) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | 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 | Yes (96410 ÷ 10 = 9641) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96410 a prime number?
No. 96410 = 2 × 5 × 31 × 311, so it is divisible by 2.
What are the factors of 96410?
1, 2, 5, 10, 31, 62, 155, 310, 311, 622, 1555, 3110, 9641, 19282, 48205, 96410.
What is 96410 in binary?
10111100010011010 (hexadecimal 1789A, octal 274232).
What is the square root of 96410?
About 310.4996.
Is 96410 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 96410?
It is a composite number with 16 divisors.