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