The number 9489
9489 is a composite number with 4 divisors. Its prime factorisation is 3 × 3163. Divisors (4): 1, 3, 3163, 9489.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9489: a semiprime: 3 × 3163, the product of two primes.
- 2
9489 is composite. Its prime factorisation is
- 3
The divisors add up to 12656; without 9489 itself that is 3167, so 9489 is deficient (3167 is less than 9489). Euler's totient φ(9489) = 6324 numbers up to 9489 share no factor with it.
- 4
The digits of 9489 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9489 = 3 \times 3163 \]
9489 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12656 |
| Euler totient φ(n) | 6324 |
| Square | 90041121 |
| Cube | 854400197169 |
| Square root | 97.411498 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 9.489 × |
9489 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and eighty-nine |
| Binary (base 2) | 10010100010001 |
| Octal (base 8) | 22421 |
| Hexadecimal (base 16) | 2511 |
| Base 3 | 111000110 |
| As time | 9489 seconds = 2 h 38 min 9 s |
Is 9489 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 (9489 ÷ 3 = 3163) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 | 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 | No (remainder 1) | 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 9) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9489 a prime number?
No. 9489 = 3 × 3163, so it is divisible by 3.
What are the factors of 9489?
1, 3, 3163, 9489.
What is 9489 in binary?
10010100010001 (hexadecimal 2511, octal 22421).
What is the square root of 9489?
About 97.4115.
Is 9489 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 9489?
9489 is a semiprime: 3 × 3163, the product of two primes.