The number 11398
11398 is a composite number with 8 divisors. Its prime factorisation is 2 × 41 × 139. Divisors (8): 1, 2, 41, 82, 139, 278, 5699, 11398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11398 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11398 is composite. Its prime factorisation is
- 3
The divisors add up to 17640; without 11398 itself that is 6242, so 11398 is deficient (6242 is less than 11398). Euler's totient φ(11398) = 5520 numbers up to 11398 share no factor with it.
- 4
The digits of 11398 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11398 = 2 \times 41 \times 139 \]
11398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17640 |
| Euler totient φ(n) | 5520 |
| Square | 129914404 |
| Cube | 1480764376792 |
| Square root | 106.761416 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1398 × |
11398 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and ninety-eight |
| Binary (base 2) | 10110010000110 |
| Octal (base 8) | 26206 |
| Hexadecimal (base 16) | 2C86 |
| Base 3 | 120122011 |
| As time | 11398 seconds = 3 h 9 min 58 s |
Is 11398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11398 ÷ 2 = 5699) | 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 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 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11398 a prime number?
No. 11398 = 2 × 41 × 139, so it is divisible by 2.
What are the factors of 11398?
1, 2, 41, 82, 139, 278, 5699, 11398.
What is 11398 in binary?
10110010000110 (hexadecimal 2C86, octal 26206).
What is the square root of 11398?
About 106.7614.
Is 11398 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 11398?
It is a composite number with 8 divisors.