The number 5609
5609 is a composite number with 4 divisors. Its prime factorisation is 71 × 79. Divisors (4): 1, 71, 79, 5609.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5609: a semiprime: 71 × 79, the product of two primes.
- 2
5609 is composite. Its prime factorisation is
- 3
The divisors add up to 5760; without 5609 itself that is 151, so 5609 is deficient (151 is less than 5609). Euler's totient φ(5609) = 5460 numbers up to 5609 share no factor with it.
- 4
The digits of 5609 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 111 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5609 = 71 \times 79 \]
5609 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5760 |
| Euler totient φ(n) | 5460 |
| Square | 31460881 |
| Cube | 176464081529 |
| Square root | 74.893257 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 111 |
| Scientific notation | 5.609 × |
5609 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and nine |
| Binary (base 2) | 1010111101001 |
| Octal (base 8) | 12751 |
| Hexadecimal (base 16) | 15E9 |
| Base 3 | 21200202 |
| As time | 5609 seconds = 1 h 33 min 29 s |
Is 5609 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 4) | 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 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 10) | 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 5609 a prime number?
No. 5609 = 71 × 79, so it is divisible by 71.
What are the factors of 5609?
1, 71, 79, 5609.
What is 5609 in binary?
1010111101001 (hexadecimal 15E9, octal 12751).
What is the square root of 5609?
About 74.8933.
Is 5609 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 5609?
5609 is a semiprime: 71 × 79, the product of two primes.