The number 53561
53561 is a composite number with 4 divisors. Its prime factorisation is 19 × 2819. Divisors (4): 1, 19, 2819, 53561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53561: a semiprime: 19 × 2819, the product of two primes.
- 2
53561 is composite. Its prime factorisation is
- 3
The divisors add up to 56400; without 53561 itself that is 2839, so 53561 is deficient (2839 is less than 53561). Euler's totient φ(53561) = 50724 numbers up to 53561 share no factor with it.
- 4
The digits of 53561 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53561 = 19 \times 2819 \]
53561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56400 |
| Euler totient φ(n) | 50724 |
| Square | 2868780721 |
| Cube | 153654764197481 |
| Square root | 231.432496 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3561 × |
53561 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred and sixty-one |
| Binary (base 2) | 1101000100111001 |
| Octal (base 8) | 150471 |
| Hexadecimal (base 16) | D139 |
| Base 3 | 2201110202 |
| As time | 53561 seconds = 14 h 52 min 41 s |
Is 53561 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53561 a prime number?
No. 53561 = 19 × 2819, so it is divisible by 19.
What are the factors of 53561?
1, 19, 2819, 53561.
What is 53561 in binary?
1101000100111001 (hexadecimal D139, octal 150471).
What is the square root of 53561?
About 231.4325.
Is 53561 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53561?
53561 is a semiprime: 19 × 2819, the product of two primes.