The number 5597
5597 is a composite number with 4 divisors. Its prime factorisation is 29 × 193. Divisors (4): 1, 29, 193, 5597.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5597: a semiprime: 29 × 193, the product of two primes.
- 2
5597 is composite. Its prime factorisation is
- 3
The divisors add up to 5820; without 5597 itself that is 223, so 5597 is deficient (223 is less than 5597). Euler's totient φ(5597) = 5376 numbers up to 5597 share no factor with it.
- 4
The digits of 5597 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5597 = 29 \times 193 \]
5597 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5820 |
| Euler totient φ(n) | 5376 |
| Square | 31326409 |
| Cube | 175333911173 |
| Square root | 74.813100 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.597 × |
5597 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and ninety-seven |
| Binary (base 2) | 1010111011101 |
| Octal (base 8) | 12735 |
| Hexadecimal (base 16) | 15DD |
| Base 3 | 21200022 |
| As time | 5597 seconds = 1 h 33 min 17 s |
Is 5597 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 2) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5597 a prime number?
No. 5597 = 29 × 193, so it is divisible by 29.
What are the factors of 5597?
1, 29, 193, 5597.
What is 5597 in binary?
1010111011101 (hexadecimal 15DD, octal 12735).
What is the square root of 5597?
About 74.8131.
Is 5597 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 5597?
5597 is a semiprime: 29 × 193, the product of two primes.