The number 10398
10398 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1733. Divisors (8): 1, 2, 3, 6, 1733, 3466, 5199, 10398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10398 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10398 is composite. Its prime factorisation is
- 3
The divisors add up to 20808; without 10398 itself that is 10410, so 10398 is abundant (10410 is more than 10398). Euler's totient φ(10398) = 3464 numbers up to 10398 share no factor with it.
- 4
The digits of 10398 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10398 = 2 \times 3 \times 1733 \]
10398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20808 |
| Euler totient φ(n) | 3464 |
| Square | 108118404 |
| Cube | 1124215164792 |
| Square root | 101.970584 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0398 × |
10398 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and ninety-eight |
| Binary (base 2) | 10100010011110 |
| Octal (base 8) | 24236 |
| Hexadecimal (base 16) | 289E |
| Base 3 | 112021010 |
| As time | 10398 seconds = 2 h 53 min 18 s |
Is 10398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10398 ÷ 2 = 5199) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10398 ÷ 3 = 3466) | 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 (10398 ÷ 6 = 1733) | 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 | No (remainder 6) | 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 3) | 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 10398 a prime number?
No. 10398 = 2 × 3 × 1733, so it is divisible by 2.
What are the factors of 10398?
1, 2, 3, 6, 1733, 3466, 5199, 10398.
What is 10398 in binary?
10100010011110 (hexadecimal 289E, octal 24236).
What is the square root of 10398?
About 101.9706.
Is 10398 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 10398?
It is a composite number with 8 divisors.