The number 51591
51591 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 593. Divisors (8): 1, 3, 29, 87, 593, 1779, 17197, 51591.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51591: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51591 is composite. Its prime factorisation is
- 3
The divisors add up to 71280; without 51591 itself that is 19689, so 51591 is deficient (19689 is less than 51591). Euler's totient φ(51591) = 33152 numbers up to 51591 share no factor with it.
- 4
The digits of 51591 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51591 = 3 \times 29 \times 593 \]
51591 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71280 |
| Euler totient φ(n) | 33152 |
| Square | 2661631281 |
| Cube | 137316219418071 |
| Square root | 227.136523 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1591 × |
51591 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and ninety-one |
| Binary (base 2) | 1100100110000111 |
| Octal (base 8) | 144607 |
| Hexadecimal (base 16) | C987 |
| Base 3 | 2121202210 |
| As time | 51591 seconds = 14 h 19 min 51 s |
Is 51591 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 | Yes (51591 ÷ 3 = 17197) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51591 a prime number?
No. 51591 = 3 × 29 × 593, so it is divisible by 3.
What are the factors of 51591?
1, 3, 29, 87, 593, 1779, 17197, 51591.
What is 51591 in binary?
1100100110000111 (hexadecimal C987, octal 144607).
What is the square root of 51591?
About 227.1365.
Is 51591 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51591?
51591 is a happy number: repeatedly adding the squares of its digits reaches 1.