The number 51597
51597 is a composite number with 30 divisors. Its prime factorisation is × × 13. Divisors (30): 1, 3, 7, 9, 13, 21, 27, 39, 49, 63, 81, 91, 117, 147, 189, 273 … 51597.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51597: a Harshad number: divisible by its digit sum 27.
- 2
51597 is composite. Its prime factorisation is
- 3
The divisors add up to 96558; without 51597 itself that is 44961, so 51597 is deficient (44961 is less than 51597). Euler's totient φ(51597) = 27216 numbers up to 51597 share no factor with it.
- 4
The digits of 51597 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51597 = 3^{4} \times 7^{2} \times 13 \]51597 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 96558 |
| Euler totient φ(n) | 27216 |
| Square | 2662250409 |
| Cube | 137364134353173 |
| Square root | 227.149730 (= 63√13) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1597 × |
51597 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and ninety-seven |
| Binary (base 2) | 1100100110001101 |
| Octal (base 8) | 144615 |
| Hexadecimal (base 16) | C98D |
| Base 3 | 2121210000 |
| As time | 51597 seconds = 14 h 19 min 57 s |
Is 51597 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 (51597 ÷ 3 = 17199) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | Yes (51597 ÷ 7 = 7371) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (51597 ÷ 9 = 5733) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51597 a prime number?
No. 51597 = × × 13, so it is divisible by 3.
What are the factors of 51597?
1, 3, 7, 9, 13, 21, 27, 39, 49, 63, 81, 91, 117, 147, 189, 273, 351, 441, 567, 637, 819, 1053, 1323, 1911, 2457, 3969, 5733, 7371, 17199, 51597.
What is 51597 in binary?
1100100110001101 (hexadecimal C98D, octal 144615).
What is the square root of 51597?
About 227.1497, exactly 63√13.
Is 51597 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 51597?
51597 is a Harshad number: divisible by its digit sum 27.