The number 50567
50567 is a composite number with 4 divisors. Its prime factorisation is 11 × 4597. Divisors (4): 1, 11, 4597, 50567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50567: a semiprime: 11 × 4597, the product of two primes.
- 2
50567 is composite. Its prime factorisation is
- 3
The divisors add up to 55176; without 50567 itself that is 4609, so 50567 is deficient (4609 is less than 50567). Euler's totient φ(50567) = 45960 numbers up to 50567 share no factor with it.
- 4
The digits of 50567 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50567 = 11 \times 4597 \]
50567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55176 |
| Euler totient φ(n) | 45960 |
| Square | 2557021489 |
| Cube | 129300905634263 |
| Square root | 224.871074 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0567 × |
50567 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and sixty-seven |
| Binary (base 2) | 1100010110000111 |
| Octal (base 8) | 142607 |
| Hexadecimal (base 16) | C587 |
| Base 3 | 2120100212 |
| As time | 50567 seconds = 14 h 2 min 47 s |
Is 50567 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 6) | 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 | Yes (50567 ÷ 11 = 4597) | 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 50567 a prime number?
No. 50567 = 11 × 4597, so it is divisible by 11.
What are the factors of 50567?
1, 11, 4597, 50567.
What is 50567 in binary?
1100010110000111 (hexadecimal C587, octal 142607).
What is the square root of 50567?
About 224.8711.
Is 50567 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50567?
50567 is a semiprime: 11 × 4597, the product of two primes.