The number 51391
51391 is a composite number with 4 divisors. Its prime factorisation is 17 × 3023. Divisors (4): 1, 17, 3023, 51391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51391: a semiprime: 17 × 3023, the product of two primes.
- 2
51391 is composite. Its prime factorisation is
- 3
The divisors add up to 54432; without 51391 itself that is 3041, so 51391 is deficient (3041 is less than 51391). Euler's totient φ(51391) = 48352 numbers up to 51391 share no factor with it.
- 4
The digits of 51391 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51391 = 17 \times 3023 \]
51391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54432 |
| Euler totient φ(n) | 48352 |
| Square | 2641034881 |
| Cube | 135725423569471 |
| Square root | 226.695831 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.1391 × |
51391 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and ninety-one |
| Binary (base 2) | 1100100010111111 |
| Octal (base 8) | 144277 |
| Hexadecimal (base 16) | C8BF |
| Base 3 | 2121111101 |
| As time | 51391 seconds = 14 h 16 min 31 s |
Is 51391 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 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 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 10) | 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 51391 a prime number?
No. 51391 = 17 × 3023, so it is divisible by 17.
What are the factors of 51391?
1, 17, 3023, 51391.
What is 51391 in binary?
1100100010111111 (hexadecimal C8BF, octal 144277).
What is the square root of 51391?
About 226.6958.
Is 51391 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51391?
51391 is a semiprime: 17 × 3023, the product of two primes.