The number 51671
51671 is a composite number with 4 divisors. Its prime factorisation is 163 × 317. Divisors (4): 1, 163, 317, 51671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51671: a semiprime: 163 × 317, the product of two primes.
- 2
51671 is composite. Its prime factorisation is
- 3
The divisors add up to 52152; without 51671 itself that is 481, so 51671 is deficient (481 is less than 51671). Euler's totient φ(51671) = 51192 numbers up to 51671 share no factor with it.
- 4
The digits of 51671 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51671 = 163 \times 317 \]
51671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52152 |
| Euler totient φ(n) | 51192 |
| Square | 2669892241 |
| Cube | 137956001984711 |
| Square root | 227.312560 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1671 × |
51671 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and seventy-one |
| Binary (base 2) | 1100100111010111 |
| Octal (base 8) | 144727 |
| Hexadecimal (base 16) | C9D7 |
| Base 3 | 2121212202 |
| As time | 51671 seconds = 14 h 21 min 11 s |
Is 51671 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 3) | 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 7) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51671 a prime number?
No. 51671 = 163 × 317, so it is divisible by 163.
What are the factors of 51671?
1, 163, 317, 51671.
What is 51671 in binary?
1100100111010111 (hexadecimal C9D7, octal 144727).
What is the square root of 51671?
About 227.3126.
Is 51671 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51671?
51671 is a semiprime: 163 × 317, the product of two primes.