The number 51291
51291 is a composite number with 12 divisors. Its prime factorisation is × 41 × 139. Divisors (12): 1, 3, 9, 41, 123, 139, 369, 417, 1251, 5699, 17097, 51291.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51291 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51291 is composite. Its prime factorisation is
- 3
The divisors add up to 76440; without 51291 itself that is 25149, so 51291 is deficient (25149 is less than 51291). Euler's totient φ(51291) = 33120 numbers up to 51291 share no factor with it.
- 4
The digits of 51291 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51291 = 3^{2} \times 41 \times 139 \]51291 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 76440 |
| Euler totient φ(n) | 33120 |
| Square | 2630766681 |
| Cube | 134934653835171 |
| Square root | 226.475164 (= 3√5699) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1291 × |
51291 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and ninety-one |
| Binary (base 2) | 1100100001011011 |
| Octal (base 8) | 144133 |
| Hexadecimal (base 16) | C85B |
| Base 3 | 2121100200 |
| As time | 51291 seconds = 14 h 14 min 51 s |
Is 51291 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 (51291 ÷ 3 = 17097) | 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 3) | 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 | Yes (51291 ÷ 9 = 5699) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51291 a prime number?
No. 51291 = × 41 × 139, so it is divisible by 3.
What are the factors of 51291?
1, 3, 9, 41, 123, 139, 369, 417, 1251, 5699, 17097, 51291.
What is 51291 in binary?
1100100001011011 (hexadecimal C85B, octal 144133).
What is the square root of 51291?
About 226.4752, exactly 3√5699.
Is 51291 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51291?
It is a composite number with 12 divisors.