The number 53390
53390 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 19 × 281. Divisors (16): 1, 2, 5, 10, 19, 38, 95, 190, 281, 562, 1405, 2810, 5339, 10678, 26695, 53390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53390 is composite. Its prime factorisation is
- 3
The divisors add up to 101520; without 53390 itself that is 48130, so 53390 is deficient (48130 is less than 53390). Euler's totient φ(53390) = 20160 numbers up to 53390 share no factor with it.
- 4
The digits of 53390 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53390 = 2 \times 5 \times 19 \times 281 \]
53390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 101520 |
| Euler totient φ(n) | 20160 |
| Square | 2850492100 |
| Cube | 152187773219000 |
| Square root | 231.062762 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.339 × |
53390 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and ninety |
| Binary (base 2) | 1101000010001110 |
| Octal (base 8) | 150216 |
| Hexadecimal (base 16) | D08E |
| Base 3 | 2201020102 |
| As time | 53390 seconds = 14 h 49 min 50 s |
Is 53390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53390 ÷ 2 = 26695) | 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 | Yes (53390 ÷ 5 = 10678) | 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 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53390 ÷ 10 = 5339) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 53390 a prime number?
No. 53390 = 2 × 5 × 19 × 281, so it is divisible by 2.
What are the factors of 53390?
1, 2, 5, 10, 19, 38, 95, 190, 281, 562, 1405, 2810, 5339, 10678, 26695, 53390.
What is 53390 in binary?
1101000010001110 (hexadecimal D08E, octal 150216).
What is the square root of 53390?
About 231.0628.
Is 53390 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53390?
It is a composite number with 16 divisors.