The number 51508
51508 is a composite number with 12 divisors. Its prime factorisation is × 79 × 163. Divisors (12): 1, 2, 4, 79, 158, 163, 316, 326, 652, 12877, 25754, 51508.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51508 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51508 is composite. Its prime factorisation is
- 3
The divisors add up to 91840; without 51508 itself that is 40332, so 51508 is deficient (40332 is less than 51508). Euler's totient φ(51508) = 25272 numbers up to 51508 share no factor with it.
- 4
The digits of 51508 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51508 = 2^{2} \times 79 \times 163 \]51508 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91840 |
| Euler totient φ(n) | 25272 |
| Square | 2653074064 |
| Cube | 136654538888512 |
| Square root | 226.953740 (= 2√12877) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1508 × |
51508 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and eight |
| Binary (base 2) | 1100100100110100 |
| Octal (base 8) | 144464 |
| Hexadecimal (base 16) | C934 |
| Base 3 | 2121122201 |
| As time | 51508 seconds = 14 h 18 min 28 s |
Is 51508 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51508 ÷ 2 = 25754) | 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 | Yes (51508 ÷ 4 = 12877) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51508 a prime number?
No. 51508 = × 79 × 163, so it is divisible by 2.
What are the factors of 51508?
1, 2, 4, 79, 158, 163, 316, 326, 652, 12877, 25754, 51508.
What is 51508 in binary?
1100100100110100 (hexadecimal C934, octal 144464).
What is the square root of 51508?
About 226.9537, exactly 2√12877.
Is 51508 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51508?
It is a composite number with 12 divisors.