The number 81567
81567 is a composite number with 20 divisors. Its prime factorisation is × 19 × 53. Divisors (20): 1, 3, 9, 19, 27, 53, 57, 81, 159, 171, 477, 513, 1007, 1431, 1539, 3021 … 81567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81567: a Harshad number: divisible by its digit sum 27.
- 2
81567 is composite. Its prime factorisation is
- 3
The divisors add up to 130680; without 81567 itself that is 49113, so 81567 is deficient (49113 is less than 81567). Euler's totient φ(81567) = 50544 numbers up to 81567 share no factor with it.
- 4
The digits of 81567 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 213 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81567 = 3^{4} \times 19 \times 53 \]81567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 130680 |
| Euler totient φ(n) | 50544 |
| Square | 6653175489 |
| Cube | 542679565111263 |
| Square root | 285.599370 (= 9√1007) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 213 |
| Scientific notation | 8.1567 × |
81567 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and sixty-seven |
| Binary (base 2) | 10011111010011111 |
| Octal (base 8) | 237237 |
| Hexadecimal (base 16) | 13E9F |
| Base 3 | 11010220000 |
| As time | 81567 seconds = 22 h 39 min 27 s |
Is 81567 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 (81567 ÷ 3 = 27189) | 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 | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (81567 ÷ 9 = 9063) | 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 2) | 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 81567 a prime number?
No. 81567 = × 19 × 53, so it is divisible by 3.
What are the factors of 81567?
1, 3, 9, 19, 27, 53, 57, 81, 159, 171, 477, 513, 1007, 1431, 1539, 3021, 4293, 9063, 27189, 81567.
What is 81567 in binary?
10011111010011111 (hexadecimal 13E9F, octal 237237).
What is the square root of 81567?
About 285.5994, exactly 9√1007.
Is 81567 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 81567?
81567 is a Harshad number: divisible by its digit sum 27.