The number 52398
52398 is a composite number with 24 divisors. Its prime factorisation is 2 × × 41 × 71. Divisors (24): 1, 2, 3, 6, 9, 18, 41, 71, 82, 123, 142, 213, 246, 369, 426, 639 … 52398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52398 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52398 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 52398 itself that is 65538, so 52398 is abundant (65538 is more than 52398). Euler's totient φ(52398) = 16800 numbers up to 52398 share no factor with it.
- 4
The digits of 52398 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52398 = 2 \times 3^{2} \times 41 \times 71 \]52398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 16800 |
| Square | 2745550404 |
| Cube | 143861350068792 |
| Square root | 228.906094 (= 3√5822) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.2398 × |
52398 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand three hundred and ninety-eight |
| Binary (base 2) | 1100110010101110 |
| Octal (base 8) | 146256 |
| Hexadecimal (base 16) | CCAE |
| Base 3 | 2122212200 |
| As time | 52398 seconds = 14 h 33 min 18 s |
Is 52398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52398 ÷ 2 = 26199) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52398 ÷ 3 = 17466) | 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 (52398 ÷ 6 = 8733) | 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 | Yes (52398 ÷ 9 = 5822) | 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 5) | 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 52398 a prime number?
No. 52398 = 2 × × 41 × 71, so it is divisible by 2.
What are the factors of 52398?
1, 2, 3, 6, 9, 18, 41, 71, 82, 123, 142, 213, 246, 369, 426, 639, 738, 1278, 2911, 5822, 8733, 17466, 26199, 52398.
What is 52398 in binary?
1100110010101110 (hexadecimal CCAE, octal 146256).
What is the square root of 52398?
About 228.9061, exactly 3√5822.
Is 52398 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 52398?
It is a composite number with 24 divisors.