The number 51571
51571 is a composite number with 4 divisors. Its prime factorisation is 13 × 3967. Divisors (4): 1, 13, 3967, 51571.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51571: a semiprime: 13 × 3967, the product of two primes.
- 2
51571 is composite. Its prime factorisation is
- 3
The divisors add up to 55552; without 51571 itself that is 3981, so 51571 is deficient (3981 is less than 51571). Euler's totient φ(51571) = 47592 numbers up to 51571 share no factor with it.
- 4
The digits of 51571 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51571 = 13 \times 3967 \]
51571 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55552 |
| Euler totient φ(n) | 47592 |
| Square | 2659568041 |
| Cube | 137156583442411 |
| Square root | 227.092492 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1571 × |
51571 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and seventy-one |
| Binary (base 2) | 1100100101110011 |
| Octal (base 8) | 144563 |
| Hexadecimal (base 16) | C973 |
| Base 3 | 2121202001 |
| As time | 51571 seconds = 14 h 19 min 31 s |
Is 51571 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51571 a prime number?
No. 51571 = 13 × 3967, so it is divisible by 13.
What are the factors of 51571?
1, 13, 3967, 51571.
What is 51571 in binary?
1100100101110011 (hexadecimal C973, octal 144563).
What is the square root of 51571?
About 227.0925.
Is 51571 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51571?
51571 is a semiprime: 13 × 3967, the product of two primes.