The number 51272
51272 is a composite number with 32 divisors. Its prime factorisation is × 13 × 17 × 29. Divisors (32): 1, 2, 4, 8, 13, 17, 26, 29, 34, 52, 58, 68, 104, 116, 136, 221 … 51272.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51272: a Harshad number: divisible by its digit sum 17.
- 2
51272 is composite. Its prime factorisation is
- 3
The divisors add up to 113400; without 51272 itself that is 62128, so 51272 is abundant (62128 is more than 51272). Euler's totient φ(51272) = 21504 numbers up to 51272 share no factor with it.
- 4
The digits of 51272 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51272 = 2^{3} \times 13 \times 17 \times 29 \]51272 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 113400 |
| Euler totient φ(n) | 21504 |
| Square | 2628817984 |
| Cube | 134784755675648 |
| Square root | 226.433213 (= 2√12818) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1272 × |
51272 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and seventy-two |
| Binary (base 2) | 1100100001001000 |
| Octal (base 8) | 144110 |
| Hexadecimal (base 16) | C848 |
| Base 3 | 2121022222 |
| As time | 51272 seconds = 14 h 14 min 32 s |
Is 51272 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51272 ÷ 2 = 25636) | 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 (51272 ÷ 4 = 12818) | 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 2) | 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 | Yes (51272 ÷ 8 = 6409) | 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 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51272 a prime number?
No. 51272 = × 13 × 17 × 29, so it is divisible by 2.
What are the factors of 51272?
1, 2, 4, 8, 13, 17, 26, 29, 34, 52, 58, 68, 104, 116, 136, 221, 232, 377, 442, 493, 754, 884, 986, 1508, 1768, 1972, 3016, 3944, 6409, 12818, 25636, 51272.
What is 51272 in binary?
1100100001001000 (hexadecimal C848, octal 144110).
What is the square root of 51272?
About 226.4332, exactly 2√12818.
Is 51272 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51272?
51272 is a Harshad number: divisible by its digit sum 17.