The number 51981
51981 is a composite number with 4 divisors. Its prime factorisation is 3 × 17327. Divisors (4): 1, 3, 17327, 51981.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51981: a semiprime: 3 × 17327, the product of two primes.
- 2
51981 is composite. Its prime factorisation is
- 3
The divisors add up to 69312; without 51981 itself that is 17331, so 51981 is deficient (17331 is less than 51981). Euler's totient φ(51981) = 34652 numbers up to 51981 share no factor with it.
- 4
The digits of 51981 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51981 = 3 \times 17327 \]
51981 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 69312 |
| Euler totient φ(n) | 34652 |
| Square | 2702024361 |
| Cube | 140453928309141 |
| Square root | 227.993421 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1981 × |
51981 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand nine hundred and eighty-one |
| Binary (base 2) | 1100101100001101 |
| Octal (base 8) | 145415 |
| Hexadecimal (base 16) | CB0D |
| Base 3 | 2122022020 |
| As time | 51981 seconds = 14 h 26 min 21 s |
Is 51981 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 (51981 ÷ 3 = 17327) | 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 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 6) | 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 51981 a prime number?
No. 51981 = 3 × 17327, so it is divisible by 3.
What are the factors of 51981?
1, 3, 17327, 51981.
What is 51981 in binary?
1100101100001101 (hexadecimal CB0D, octal 145415).
What is the square root of 51981?
About 227.9934.
Is 51981 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 51981?
51981 is a semiprime: 3 × 17327, the product of two primes.