The number 53398
53398 is a composite number with 4 divisors. Its prime factorisation is 2 × 26699. Divisors (4): 1, 2, 26699, 53398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53398: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 26699, the product of two primes.
- 2
53398 is composite. Its prime factorisation is
- 3
The divisors add up to 80100; without 53398 itself that is 26702, so 53398 is deficient (26702 is less than 53398). Euler's totient φ(53398) = 26698 numbers up to 53398 share no factor with it.
- 4
The digits of 53398 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53398 = 2 \times 26699 \]
53398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 80100 |
| Euler totient φ(n) | 26698 |
| Square | 2851346404 |
| Cube | 152256195280792 |
| Square root | 231.080073 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.3398 × |
53398 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and ninety-eight |
| Binary (base 2) | 1101000010010110 |
| Octal (base 8) | 150226 |
| Hexadecimal (base 16) | D096 |
| Base 3 | 2201020201 |
| As time | 53398 seconds = 14 h 49 min 58 s |
Is 53398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53398 ÷ 2 = 26699) | 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 1) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53398 a prime number?
No. 53398 = 2 × 26699, so it is divisible by 2.
What are the factors of 53398?
1, 2, 26699, 53398.
What is 53398 in binary?
1101000010010110 (hexadecimal D096, octal 150226).
What is the square root of 53398?
About 231.0801.
Is 53398 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 53398?
53398 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 26699, the product of two primes.