The number 51371
51371 is a composite number with 4 divisors. Its prime factorisation is 47 × 1093. Divisors (4): 1, 47, 1093, 51371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51371: a semiprime: 47 × 1093, the product of two primes.
- 2
51371 is composite. Its prime factorisation is
- 3
The divisors add up to 52512; without 51371 itself that is 1141, so 51371 is deficient (1141 is less than 51371). Euler's totient φ(51371) = 50232 numbers up to 51371 share no factor with it.
- 4
The digits of 51371 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51371 = 47 \times 1093 \]
51371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52512 |
| Euler totient φ(n) | 50232 |
| Square | 2638979641 |
| Cube | 135567023137811 |
| Square root | 226.651715 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1371 × |
51371 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and seventy-one |
| Binary (base 2) | 1100100010101011 |
| Octal (base 8) | 144253 |
| Hexadecimal (base 16) | C8AB |
| Base 3 | 2121110122 |
| As time | 51371 seconds = 14 h 16 min 11 s |
Is 51371 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 5) | 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 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51371 a prime number?
No. 51371 = 47 × 1093, so it is divisible by 47.
What are the factors of 51371?
1, 47, 1093, 51371.
What is 51371 in binary?
1100100010101011 (hexadecimal C8AB, octal 144253).
What is the square root of 51371?
About 226.6517.
Is 51371 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51371?
51371 is a semiprime: 47 × 1093, the product of two primes.