The number 51559
51559 is a composite number with 4 divisors. Its prime factorisation is 47 × 1097. Divisors (4): 1, 47, 1097, 51559.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51559: a semiprime: 47 × 1097, the product of two primes.
- 2
51559 is composite. Its prime factorisation is
- 3
The divisors add up to 52704; without 51559 itself that is 1145, so 51559 is deficient (1145 is less than 51559). Euler's totient φ(51559) = 50416 numbers up to 51559 share no factor with it.
- 4
The digits of 51559 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51559 = 47 \times 1097 \]
51559 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52704 |
| Euler totient φ(n) | 50416 |
| Square | 2658330481 |
| Cube | 137060861269879 |
| Square root | 227.066070 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1559 × |
51559 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and fifty-nine |
| Binary (base 2) | 1100100101100111 |
| Octal (base 8) | 144547 |
| Hexadecimal (base 16) | C967 |
| Base 3 | 2121201121 |
| As time | 51559 seconds = 14 h 19 min 19 s |
Is 51559 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51559 a prime number?
No. 51559 = 47 × 1097, so it is divisible by 47.
What are the factors of 51559?
1, 47, 1097, 51559.
What is 51559 in binary?
1100100101100111 (hexadecimal C967, octal 144547).
What is the square root of 51559?
About 227.0661.
Is 51559 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 51559?
51559 is a semiprime: 47 × 1097, the product of two primes.