The number 53498
53498 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 1163. Divisors (8): 1, 2, 23, 46, 1163, 2326, 26749, 53498.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53498 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53498 is composite. Its prime factorisation is
- 3
The divisors add up to 83808; without 53498 itself that is 30310, so 53498 is deficient (30310 is less than 53498). Euler's totient φ(53498) = 25564 numbers up to 53498 share no factor with it.
- 4
The digits of 53498 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53498 = 2 \times 23 \times 1163 \]
53498 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 83808 |
| Euler totient φ(n) | 25564 |
| Square | 2862036004 |
| Cube | 153113202141992 |
| Square root | 231.296347 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.3498 × |
53498 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and ninety-eight |
| Binary (base 2) | 1101000011111010 |
| Octal (base 8) | 150372 |
| Hexadecimal (base 16) | D0FA |
| Base 3 | 2201101102 |
| As time | 53498 seconds = 14 h 51 min 38 s |
Is 53498 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53498 ÷ 2 = 26749) | 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53498 a prime number?
No. 53498 = 2 × 23 × 1163, so it is divisible by 2.
What are the factors of 53498?
1, 2, 23, 46, 1163, 2326, 26749, 53498.
What is 53498 in binary?
1101000011111010 (hexadecimal D0FA, octal 150372).
What is the square root of 53498?
About 231.2963.
Is 53498 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 53498?
It is a composite number with 8 divisors.