The number 9398
9398 is a composite number with 8 divisors. Its prime factorisation is 2 × 37 × 127. Divisors (8): 1, 2, 37, 74, 127, 254, 4699, 9398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9398 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9398 is composite. Its prime factorisation is
- 3
The divisors add up to 14592; without 9398 itself that is 5194, so 9398 is deficient (5194 is less than 9398). Euler's totient φ(9398) = 4536 numbers up to 9398 share no factor with it.
- 4
The digits of 9398 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9398 = 2 \times 37 \times 127 \]
9398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 14592 |
| Euler totient φ(n) | 4536 |
| Square | 88322404 |
| Cube | 830053952792 |
| Square root | 96.943282 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 9.398 × |
9398 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and ninety-eight |
| Binary (base 2) | 10010010110110 |
| Octal (base 8) | 22266 |
| Hexadecimal (base 16) | 24B6 |
| Base 3 | 110220002 |
| As time | 9398 seconds = 2 h 36 min 38 s |
Is 9398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9398 ÷ 2 = 4699) | 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 | 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 | No (remainder 2) | 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 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9398 a prime number?
No. 9398 = 2 × 37 × 127, so it is divisible by 2.
What are the factors of 9398?
1, 2, 37, 74, 127, 254, 4699, 9398.
What is 9398 in binary?
10010010110110 (hexadecimal 24B6, octal 22266).
What is the square root of 9398?
About 96.9433.
Is 9398 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 9398?
It is a composite number with 8 divisors.