The number 53567
53567 is a composite number with 8 divisors. Its prime factorisation is 17 × 23 × 137. Divisors (8): 1, 17, 23, 137, 391, 2329, 3151, 53567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53567 is composite. Its prime factorisation is
- 3
The divisors add up to 59616; without 53567 itself that is 6049, so 53567 is deficient (6049 is less than 53567). Euler's totient φ(53567) = 47872 numbers up to 53567 share no factor with it.
- 4
The digits of 53567 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53567 = 17 \times 23 \times 137 \]
53567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59616 |
| Euler totient φ(n) | 47872 |
| Square | 2869423489 |
| Cube | 153706408035263 |
| Square root | 231.445458 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3567 × |
53567 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred and sixty-seven |
| Binary (base 2) | 1101000100111111 |
| Octal (base 8) | 150477 |
| Hexadecimal (base 16) | D13F |
| Base 3 | 2201110222 |
| As time | 53567 seconds = 14 h 52 min 47 s |
Is 53567 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 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 | No (remainder 8) | 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 8) | 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 53567 a prime number?
No. 53567 = 17 × 23 × 137, so it is divisible by 17.
What are the factors of 53567?
1, 17, 23, 137, 391, 2329, 3151, 53567.
What is 53567 in binary?
1101000100111111 (hexadecimal D13F, octal 150477).
What is the square root of 53567?
About 231.4455.
Is 53567 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 53567?
It is a composite number with 8 divisors.