The number 5561
5561 is a composite number with 4 divisors. Its prime factorisation is 67 × 83. Divisors (4): 1, 67, 83, 5561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5561: a semiprime: 67 × 83, the product of two primes.
- 2
5561 is composite. Its prime factorisation is
- 3
The divisors add up to 5712; without 5561 itself that is 151, so 5561 is deficient (151 is less than 5561). Euler's totient φ(5561) = 5412 numbers up to 5561 share no factor with it.
- 4
The digits of 5561 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5561 = 67 \times 83 \]
5561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5712 |
| Euler totient φ(n) | 5412 |
| Square | 30924721 |
| Cube | 171972373481 |
| Square root | 74.572113 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 129 |
| Scientific notation | 5.561 × |
5561 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and sixty-one |
| Binary (base 2) | 1010110111001 |
| Octal (base 8) | 12671 |
| Hexadecimal (base 16) | 15B9 |
| Base 3 | 21121222 |
| As time | 5561 seconds = 1 h 32 min 41 s |
Is 5561 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 1) | 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 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 5561 a prime number?
No. 5561 = 67 × 83, so it is divisible by 67.
What are the factors of 5561?
1, 67, 83, 5561.
What is 5561 in binary?
1010110111001 (hexadecimal 15B9, octal 12671).
What is the square root of 5561?
About 74.5721.
Is 5561 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 5561?
5561 is a semiprime: 67 × 83, the product of two primes.