The number 51142
51142 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 13 × 281. Divisors (16): 1, 2, 7, 13, 14, 26, 91, 182, 281, 562, 1967, 3653, 3934, 7306, 25571, 51142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51142: a Harshad number: divisible by its digit sum 13.
- 2
51142 is composite. Its prime factorisation is
- 3
The divisors add up to 94752; without 51142 itself that is 43610, so 51142 is deficient (43610 is less than 51142). Euler's totient φ(51142) = 20160 numbers up to 51142 share no factor with it.
- 4
The digits of 51142 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51142 = 2 \times 7 \times 13 \times 281 \]
51142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 94752 |
| Euler totient φ(n) | 20160 |
| Square | 2615504164 |
| Cube | 133762113955288 |
| Square root | 226.145971 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1142 × |
51142 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and forty-two |
| Binary (base 2) | 1100011111000110 |
| Octal (base 8) | 143706 |
| Hexadecimal (base 16) | C7C6 |
| Base 3 | 2121011011 |
| As time | 51142 seconds = 14 h 12 min 22 s |
Is 51142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51142 ÷ 2 = 25571) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (51142 ÷ 7 = 7306) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51142 a prime number?
No. 51142 = 2 × 7 × 13 × 281, so it is divisible by 2.
What are the factors of 51142?
1, 2, 7, 13, 14, 26, 91, 182, 281, 562, 1967, 3653, 3934, 7306, 25571, 51142.
What is 51142 in binary?
1100011111000110 (hexadecimal C7C6, octal 143706).
What is the square root of 51142?
About 226.1460.
Is 51142 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 51142?
51142 is a Harshad number: divisible by its digit sum 13.