The number 51561
51561 is a composite number with 12 divisors. Its prime factorisation is × 17 × 337. Divisors (12): 1, 3, 9, 17, 51, 153, 337, 1011, 3033, 5729, 17187, 51561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51561 is composite. Its prime factorisation is
- 3
The divisors add up to 79092; without 51561 itself that is 27531, so 51561 is deficient (27531 is less than 51561). Euler's totient φ(51561) = 32256 numbers up to 51561 share no factor with it.
- 4
The digits of 51561 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51561 = 3^{2} \times 17 \times 337 \]51561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 79092 |
| Euler totient φ(n) | 32256 |
| Square | 2658536721 |
| Cube | 137076811871481 |
| Square root | 227.070474 (= 3√5729) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1561 × |
51561 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and sixty-one |
| Binary (base 2) | 1100100101101001 |
| Octal (base 8) | 144551 |
| Hexadecimal (base 16) | C969 |
| Base 3 | 2121201200 |
| As time | 51561 seconds = 14 h 19 min 21 s |
Is 51561 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 | Yes (51561 ÷ 3 = 17187) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (51561 ÷ 9 = 5729) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51561 a prime number?
No. 51561 = × 17 × 337, so it is divisible by 3.
What are the factors of 51561?
1, 3, 9, 17, 51, 153, 337, 1011, 3033, 5729, 17187, 51561.
What is 51561 in binary?
1100100101101001 (hexadecimal C969, octal 144551).
What is the square root of 51561?
About 227.0705, exactly 3√5729.
Is 51561 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51561?
It is a composite number with 12 divisors.