The number 9498
9498 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1583. Divisors (8): 1, 2, 3, 6, 1583, 3166, 4749, 9498.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9498 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9498 is composite. Its prime factorisation is
- 3
The divisors add up to 19008; without 9498 itself that is 9510, so 9498 is abundant (9510 is more than 9498). Euler's totient φ(9498) = 3164 numbers up to 9498 share no factor with it.
- 4
The digits of 9498 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9498 = 2 \times 3 \times 1583 \]
9498 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19008 |
| Euler totient φ(n) | 3164 |
| Square | 90212004 |
| Cube | 856833613992 |
| Square root | 97.457683 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 9.498 × |
9498 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and ninety-eight |
| Binary (base 2) | 10010100011010 |
| Octal (base 8) | 22432 |
| Hexadecimal (base 16) | 251A |
| Base 3 | 111000210 |
| As time | 9498 seconds = 2 h 38 min 18 s |
Is 9498 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9498 ÷ 2 = 4749) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9498 ÷ 3 = 3166) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (9498 ÷ 6 = 1583) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9498 a prime number?
No. 9498 = 2 × 3 × 1583, so it is divisible by 2.
What are the factors of 9498?
1, 2, 3, 6, 1583, 3166, 4749, 9498.
What is 9498 in binary?
10010100011010 (hexadecimal 251A, octal 22432).
What is the square root of 9498?
About 97.4577.
Is 9498 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 9498?
It is a composite number with 8 divisors.