The number 51042
51042 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 47 × 181. Divisors (16): 1, 2, 3, 6, 47, 94, 141, 181, 282, 362, 543, 1086, 8507, 17014, 25521, 51042.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51042 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51042 is composite. Its prime factorisation is
- 3
The divisors add up to 104832; without 51042 itself that is 53790, so 51042 is abundant (53790 is more than 51042). Euler's totient φ(51042) = 16560 numbers up to 51042 share no factor with it.
- 4
The digits of 51042 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51042 = 2 \times 3 \times 47 \times 181 \]
51042 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 104832 |
| Euler totient φ(n) | 16560 |
| Square | 2605285764 |
| Cube | 132978995966088 |
| Square root | 225.924766 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1042 × |
51042 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and forty-two |
| Binary (base 2) | 1100011101100010 |
| Octal (base 8) | 143542 |
| Hexadecimal (base 16) | C762 |
| Base 3 | 2121000110 |
| As time | 51042 seconds = 14 h 10 min 42 s |
Is 51042 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51042 ÷ 2 = 25521) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51042 ÷ 3 = 17014) | 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 | Yes (51042 ÷ 6 = 8507) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51042 a prime number?
No. 51042 = 2 × 3 × 47 × 181, so it is divisible by 2.
What are the factors of 51042?
1, 2, 3, 6, 47, 94, 141, 181, 282, 362, 543, 1086, 8507, 17014, 25521, 51042.
What is 51042 in binary?
1100011101100010 (hexadecimal C762, octal 143542).
What is the square root of 51042?
About 225.9248.
Is 51042 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51042?
It is a composite number with 16 divisors.