The number 51147
51147 is a composite number with 6 divisors. Its prime factorisation is × 5683. Divisors (6): 1, 3, 9, 5683, 17049, 51147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51147 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51147 is composite. Its prime factorisation is
- 3
The divisors add up to 73892; without 51147 itself that is 22745, so 51147 is deficient (22745 is less than 51147). Euler's totient φ(51147) = 34092 numbers up to 51147 share no factor with it.
- 4
The digits of 51147 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51147 = 3^{2} \times 5683 \]51147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 73892 |
| Euler totient φ(n) | 34092 |
| Square | 2616015609 |
| Cube | 133801350353523 |
| Square root | 226.157025 (= 3√5683) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1147 × |
51147 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and forty-seven |
| Binary (base 2) | 1100011111001011 |
| Octal (base 8) | 143713 |
| Hexadecimal (base 16) | C7CB |
| Base 3 | 2121011100 |
| As time | 51147 seconds = 14 h 12 min 27 s |
Is 51147 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 (51147 ÷ 3 = 17049) | 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 2) | 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 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 | Yes (51147 ÷ 9 = 5683) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 51147 a prime number?
No. 51147 = × 5683, so it is divisible by 3.
What are the factors of 51147?
1, 3, 9, 5683, 17049, 51147.
What is 51147 in binary?
1100011111001011 (hexadecimal C7CB, octal 143713).
What is the square root of 51147?
About 226.1570, exactly 3√5683.
Is 51147 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51147?
It is a composite number with 6 divisors.