The number 567
567 is a composite number with 10 divisors. Its prime factorisation is × 7. Divisors (10): 1, 3, 7, 9, 21, 27, 63, 81, 189, 567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
567 is composite. Its prime factorisation is
- 3
The divisors add up to 968; without 567 itself that is 401, so 567 is deficient (401 is less than 567). Euler's totient φ(567) = 324 numbers up to 567 share no factor with it.
- 4
The digits of 567 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 61 steps to reach 1.
LaTeX source of the formulas on this page
\[ 567 = 3^{4} \times 7 \]567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 968 |
| Euler totient φ(n) | 324 |
| Square | 321489 |
| Cube | 182284263 |
| Square root | 23.811762 (= 9√7) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 61 |
| Scientific notation | 5.67 × |
567 in other forms
| Form | Value |
|---|---|
| In words | five hundred and sixty-seven |
| Roman numerals | DLXVII |
| Binary (base 2) | 1000110111 |
| Octal (base 8) | 1067 |
| Hexadecimal (base 16) | 237 |
| Base 3 | 210000 |
| As time | 567 seconds = 9 min 27 s |
Is 567 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 | Yes (567 ÷ 3 = 189) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (567 ÷ 7 = 81) | 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 | Yes (567 ÷ 9 = 63) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 567 a prime number?
No. 567 = × 7, so it is divisible by 3.
What are the factors of 567?
1, 3, 7, 9, 21, 27, 63, 81, 189, 567.
What is 567 in binary?
1000110111 (hexadecimal 237, octal 1067).
What is the square root of 567?
About 23.8118, exactly 9√7.
What is 567 in Roman numerals?
DLXVII.
Is 567 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 567?
It is a composite number with 10 divisors.