The number 51261
51261 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2441. Divisors (8): 1, 3, 7, 21, 2441, 7323, 17087, 51261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51261 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51261 is composite. Its prime factorisation is
- 3
The divisors add up to 78144; without 51261 itself that is 26883, so 51261 is deficient (26883 is less than 51261). Euler's totient φ(51261) = 29280 numbers up to 51261 share no factor with it.
- 4
The digits of 51261 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51261 = 3 \times 7 \times 2441 \]
51261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78144 |
| Euler totient φ(n) | 29280 |
| Square | 2627690121 |
| Cube | 134698023292581 |
| Square root | 226.408922 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1261 × |
51261 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and sixty-one |
| Binary (base 2) | 1100100000111101 |
| Octal (base 8) | 144075 |
| Hexadecimal (base 16) | C83D |
| Base 3 | 2121022120 |
| As time | 51261 seconds = 14 h 14 min 21 s |
Is 51261 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 (51261 ÷ 3 = 17087) | 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 | Yes (51261 ÷ 7 = 7323) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 1) | 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 51261 a prime number?
No. 51261 = 3 × 7 × 2441, so it is divisible by 3.
What are the factors of 51261?
1, 3, 7, 21, 2441, 7323, 17087, 51261.
What is 51261 in binary?
1100100000111101 (hexadecimal C83D, octal 144075).
What is the square root of 51261?
About 226.4089.
Is 51261 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51261?
It is a composite number with 8 divisors.