The number 51558
51558 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 13 × 661. Divisors (16): 1, 2, 3, 6, 13, 26, 39, 78, 661, 1322, 1983, 3966, 8593, 17186, 25779, 51558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51558 is composite. Its prime factorisation is
- 3
The divisors add up to 111216; without 51558 itself that is 59658, so 51558 is abundant (59658 is more than 51558). Euler's totient φ(51558) = 15840 numbers up to 51558 share no factor with it.
- 4
The digits of 51558 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51558 = 2 \times 3 \times 13 \times 661 \]
51558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 111216 |
| Euler totient φ(n) | 15840 |
| Square | 2658227364 |
| Cube | 137052886433112 |
| Square root | 227.063868 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1558 × |
51558 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and fifty-eight |
| Binary (base 2) | 1100100101100110 |
| Octal (base 8) | 144546 |
| Hexadecimal (base 16) | C966 |
| Base 3 | 2121201120 |
| As time | 51558 seconds = 14 h 19 min 18 s |
Is 51558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51558 ÷ 2 = 25779) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51558 ÷ 3 = 17186) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51558 ÷ 6 = 8593) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 1) | 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 51558 a prime number?
No. 51558 = 2 × 3 × 13 × 661, so it is divisible by 2.
What are the factors of 51558?
1, 2, 3, 6, 13, 26, 39, 78, 661, 1322, 1983, 3966, 8593, 17186, 25779, 51558.
What is 51558 in binary?
1100100101100110 (hexadecimal C966, octal 144546).
What is the square root of 51558?
About 227.0639.
Is 51558 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 51558?
It is a composite number with 16 divisors.