The number 53590
53590 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 23 × 233. Divisors (16): 1, 2, 5, 10, 23, 46, 115, 230, 233, 466, 1165, 2330, 5359, 10718, 26795, 53590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53590 is composite. Its prime factorisation is
- 3
The divisors add up to 101088; without 53590 itself that is 47498, so 53590 is deficient (47498 is less than 53590). Euler's totient φ(53590) = 20416 numbers up to 53590 share no factor with it.
- 4
The digits of 53590 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53590 = 2 \times 5 \times 23 \times 233 \]
53590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 101088 |
| Euler totient φ(n) | 20416 |
| Square | 2871888100 |
| Cube | 153904483279000 |
| Square root | 231.495140 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.359 × |
53590 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred and ninety |
| Binary (base 2) | 1101000101010110 |
| Octal (base 8) | 150526 |
| Hexadecimal (base 16) | D156 |
| Base 3 | 2201111211 |
| As time | 53590 seconds = 14 h 53 min 10 s |
Is 53590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53590 ÷ 2 = 26795) | 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 | Yes (53590 ÷ 5 = 10718) | 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 5) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53590 ÷ 10 = 5359) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 53590 a prime number?
No. 53590 = 2 × 5 × 23 × 233, so it is divisible by 2.
What are the factors of 53590?
1, 2, 5, 10, 23, 46, 115, 230, 233, 466, 1165, 2330, 5359, 10718, 26795, 53590.
What is 53590 in binary?
1101000101010110 (hexadecimal D156, octal 150526).
What is the square root of 53590?
About 231.4951.
Is 53590 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 53590?
It is a composite number with 16 divisors.