The number 15398
15398 is a composite number with 4 divisors. Its prime factorisation is 2 × 7699. Divisors (4): 1, 2, 7699, 15398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15398: a semiprime: 2 × 7699, the product of two primes.
- 2
15398 is composite. Its prime factorisation is
- 3
The divisors add up to 23100; without 15398 itself that is 7702, so 15398 is deficient (7702 is less than 15398). Euler's totient φ(15398) = 7698 numbers up to 15398 share no factor with it.
- 4
The digits of 15398 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15398 = 2 \times 7699 \]
15398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 23100 |
| Euler totient φ(n) | 7698 |
| Square | 237098404 |
| Cube | 3650841224792 |
| Square root | 124.088678 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5398 × |
15398 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and ninety-eight |
| Binary (base 2) | 11110000100110 |
| Octal (base 8) | 36046 |
| Hexadecimal (base 16) | 3C26 |
| Base 3 | 210010022 |
| As time | 15398 seconds = 4 h 16 min 38 s |
Is 15398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15398 ÷ 2 = 7699) | 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 5) | 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 8) | 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 9) | 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 15398 a prime number?
No. 15398 = 2 × 7699, so it is divisible by 2.
What are the factors of 15398?
1, 2, 7699, 15398.
What is 15398 in binary?
11110000100110 (hexadecimal 3C26, octal 36046).
What is the square root of 15398?
About 124.0887.
Is 15398 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 15398?
15398 is a semiprime: 2 × 7699, the product of two primes.