The number 9487
9487 is a composite number with 4 divisors. Its prime factorisation is 53 × 179. Divisors (4): 1, 53, 179, 9487.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9487: a semiprime: 53 × 179, the product of two primes.
- 2
9487 is composite. Its prime factorisation is
- 3
The divisors add up to 9720; without 9487 itself that is 233, so 9487 is deficient (233 is less than 9487). Euler's totient φ(9487) = 9256 numbers up to 9487 share no factor with it.
- 4
The digits of 9487 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9487 = 53 \times 179 \]
9487 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9720 |
| Euler totient φ(n) | 9256 |
| Square | 90003169 |
| Cube | 853860064303 |
| Square root | 97.401232 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.487 × |
9487 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and eighty-seven |
| Binary (base 2) | 10010100001111 |
| Octal (base 8) | 22417 |
| Hexadecimal (base 16) | 250F |
| Base 3 | 111000101 |
| As time | 9487 seconds = 2 h 38 min 7 s |
Is 9487 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9487 a prime number?
No. 9487 = 53 × 179, so it is divisible by 53.
What are the factors of 9487?
1, 53, 179, 9487.
What is 9487 in binary?
10010100001111 (hexadecimal 250F, octal 22417).
What is the square root of 9487?
About 97.4012.
Is 9487 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 9487?
9487 is a semiprime: 53 × 179, the product of two primes.