The number 51476
51476 is a composite number with 12 divisors. Its prime factorisation is × 17 × 757. Divisors (12): 1, 2, 4, 17, 34, 68, 757, 1514, 3028, 12869, 25738, 51476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51476 is composite. Its prime factorisation is
- 3
The divisors add up to 95508; without 51476 itself that is 44032, so 51476 is deficient (44032 is less than 51476). Euler's totient φ(51476) = 24192 numbers up to 51476 share no factor with it.
- 4
The digits of 51476 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51476 = 2^{2} \times 17 \times 757 \]51476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 95508 |
| Euler totient φ(n) | 24192 |
| Square | 2649778576 |
| Cube | 136400001978176 |
| Square root | 226.883230 (= 2√12869) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1476 × |
51476 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and seventy-six |
| Binary (base 2) | 1100100100010100 |
| Octal (base 8) | 144424 |
| Hexadecimal (base 16) | C914 |
| Base 3 | 2121121112 |
| As time | 51476 seconds = 14 h 17 min 56 s |
Is 51476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51476 ÷ 2 = 25738) | 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 | Yes (51476 ÷ 4 = 12869) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51476 a prime number?
No. 51476 = × 17 × 757, so it is divisible by 2.
What are the factors of 51476?
1, 2, 4, 17, 34, 68, 757, 1514, 3028, 12869, 25738, 51476.
What is 51476 in binary?
1100100100010100 (hexadecimal C914, octal 144424).
What is the square root of 51476?
About 226.8832, exactly 2√12869.
Is 51476 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 51476?
It is a composite number with 12 divisors.