The number 96470
96470 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 877. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 877, 1754, 4385, 8770, 9647, 19294, 48235, 96470.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96470 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96470 is composite. Its prime factorisation is
- 3
The divisors add up to 189648; without 96470 itself that is 93178, so 96470 is deficient (93178 is less than 96470). Euler's totient φ(96470) = 35040 numbers up to 96470 share no factor with it.
- 4
The digits of 96470 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96470 = 2 \times 5 \times 11 \times 877 \]
96470 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 189648 |
| Euler totient φ(n) | 35040 |
| Square | 9306460900 |
| Cube | 897794283023000 |
| Square root | 310.596201 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.647 × |
96470 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and seventy |
| Binary (base 2) | 10111100011010110 |
| Octal (base 8) | 274326 |
| Hexadecimal (base 16) | 178D6 |
| Base 3 | 11220022222 |
| As time | 96470 seconds = 26 h 47 min 50 s |
Is 96470 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (96470 ÷ 2 = 48235) | 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 (96470 ÷ 5 = 19294) | 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 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (96470 ÷ 10 = 9647) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (96470 ÷ 11 = 8770) | 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 96470 a prime number?
No. 96470 = 2 × 5 × 11 × 877, so it is divisible by 2.
What are the factors of 96470?
1, 2, 5, 10, 11, 22, 55, 110, 877, 1754, 4385, 8770, 9647, 19294, 48235, 96470.
What is 96470 in binary?
10111100011010110 (hexadecimal 178D6, octal 274326).
What is the square root of 96470?
About 310.5962.
Is 96470 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 96470?
It is a composite number with 16 divisors.