The number 9496
9496 is a composite number with 8 divisors. Its prime factorisation is × 1187. Divisors (8): 1, 2, 4, 8, 1187, 2374, 4748, 9496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9496 is composite. Its prime factorisation is
- 3
The divisors add up to 17820; without 9496 itself that is 8324, so 9496 is deficient (8324 is less than 9496). Euler's totient φ(9496) = 4744 numbers up to 9496 share no factor with it.
- 4
The digits of 9496 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9496 = 2^{3} \times 1187 \]9496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17820 |
| Euler totient φ(n) | 4744 |
| Square | 90174016 |
| Cube | 856292455936 |
| Square root | 97.447422 (= 2√2374) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 9.496 × |
9496 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and ninety-six |
| Binary (base 2) | 10010100011000 |
| Octal (base 8) | 22430 |
| Hexadecimal (base 16) | 2518 |
| Base 3 | 111000201 |
| As time | 9496 seconds = 2 h 38 min 16 s |
Is 9496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9496 ÷ 2 = 4748) | 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 | Yes (9496 ÷ 4 = 2374) | 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 4) | 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 | Yes (9496 ÷ 8 = 1187) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9496 a prime number?
No. 9496 = × 1187, so it is divisible by 2.
What are the factors of 9496?
1, 2, 4, 8, 1187, 2374, 4748, 9496.
What is 9496 in binary?
10010100011000 (hexadecimal 2518, octal 22430).
What is the square root of 9496?
About 97.4474, exactly 2√2374.
Is 9496 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 9496?
It is a composite number with 8 divisors.