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