The number 51961
51961 is a composite number with 8 divisors. Its prime factorisation is 7 × 13 × 571. Divisors (8): 1, 7, 13, 91, 571, 3997, 7423, 51961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51961 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51961 is composite. Its prime factorisation is
- 3
The divisors add up to 64064; without 51961 itself that is 12103, so 51961 is deficient (12103 is less than 51961). Euler's totient φ(51961) = 41040 numbers up to 51961 share no factor with it.
- 4
The digits of 51961 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 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51961 = 7 \times 13 \times 571 \]
51961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 64064 |
| Euler totient φ(n) | 41040 |
| Square | 2699945521 |
| Cube | 140291869216681 |
| Square root | 227.949556 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1961 × |
51961 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand nine hundred and sixty-one |
| Binary (base 2) | 1100101011111001 |
| Octal (base 8) | 145371 |
| Hexadecimal (base 16) | CAF9 |
| Base 3 | 2122021111 |
| As time | 51961 seconds = 14 h 26 min 1 s |
Is 51961 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (51961 ÷ 7 = 7423) | 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 4) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51961 a prime number?
No. 51961 = 7 × 13 × 571, so it is divisible by 7.
What are the factors of 51961?
1, 7, 13, 91, 571, 3997, 7423, 51961.
What is 51961 in binary?
1100101011111001 (hexadecimal CAF9, octal 145371).
What is the square root of 51961?
About 227.9496.
Is 51961 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 51961?
It is a composite number with 8 divisors.