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