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