The number 51608
51608 is a composite number with 8 divisors. Its prime factorisation is × 6451. Divisors (8): 1, 2, 4, 8, 6451, 12902, 25804, 51608.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51608 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51608 is composite. Its prime factorisation is
- 3
The divisors add up to 96780; without 51608 itself that is 45172, so 51608 is deficient (45172 is less than 51608). Euler's totient φ(51608) = 25800 numbers up to 51608 share no factor with it.
- 4
The digits of 51608 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51608 = 2^{3} \times 6451 \]51608 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 96780 |
| Euler totient φ(n) | 25800 |
| Square | 2663385664 |
| Cube | 137452007347712 |
| Square root | 227.173942 (= 2√12902) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1608 × |
51608 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and eight |
| Binary (base 2) | 1100100110011000 |
| Octal (base 8) | 144630 |
| Hexadecimal (base 16) | C998 |
| Base 3 | 2121210102 |
| As time | 51608 seconds = 14 h 20 min 8 s |
Is 51608 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51608 ÷ 2 = 25804) | 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 (51608 ÷ 4 = 12902) | 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 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 (51608 ÷ 8 = 6451) | 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 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 51608 a prime number?
No. 51608 = × 6451, so it is divisible by 2.
What are the factors of 51608?
1, 2, 4, 8, 6451, 12902, 25804, 51608.
What is 51608 in binary?
1100100110011000 (hexadecimal C998, octal 144630).
What is the square root of 51608?
About 227.1739, exactly 2√12902.
Is 51608 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51608?
It is a composite number with 8 divisors.