The number 51068
51068 is a composite number with 12 divisors. Its prime factorisation is × 17 × 751. Divisors (12): 1, 2, 4, 17, 34, 68, 751, 1502, 3004, 12767, 25534, 51068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51068 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51068 is composite. Its prime factorisation is
- 3
The divisors add up to 94752; without 51068 itself that is 43684, so 51068 is deficient (43684 is less than 51068). Euler's totient φ(51068) = 24000 numbers up to 51068 share no factor with it.
- 4
The digits of 51068 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51068 = 2^{2} \times 17 \times 751 \]51068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 94752 |
| Euler totient φ(n) | 24000 |
| Square | 2607940624 |
| Cube | 133182311786432 |
| Square root | 225.982300 (= 2√12767) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1068 × |
51068 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and sixty-eight |
| Binary (base 2) | 1100011101111100 |
| Octal (base 8) | 143574 |
| Hexadecimal (base 16) | C77C |
| Base 3 | 2121001102 |
| As time | 51068 seconds = 14 h 11 min 8 s |
Is 51068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51068 ÷ 2 = 25534) | 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 (51068 ÷ 4 = 12767) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 3) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 51068 a prime number?
No. 51068 = × 17 × 751, so it is divisible by 2.
What are the factors of 51068?
1, 2, 4, 17, 34, 68, 751, 1502, 3004, 12767, 25534, 51068.
What is 51068 in binary?
1100011101111100 (hexadecimal C77C, octal 143574).
What is the square root of 51068?
About 225.9823, exactly 2√12767.
Is 51068 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51068?
It is a composite number with 12 divisors.