The number 50569
50569 is a composite number with 4 divisors. Its prime factorisation is 61 × 829. Divisors (4): 1, 61, 829, 50569.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50569: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 829, the product of two primes.
- 2
50569 is composite. Its prime factorisation is
- 3
The divisors add up to 51460; without 50569 itself that is 891, so 50569 is deficient (891 is less than 50569). Euler's totient φ(50569) = 49680 numbers up to 50569 share no factor with it.
- 4
The digits of 50569 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50569 = 61 \times 829 \]
50569 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51460 |
| Euler totient φ(n) | 49680 |
| Square | 2557223761 |
| Cube | 129316248370009 |
| Square root | 224.875521 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0569 × |
50569 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and sixty-nine |
| Binary (base 2) | 1100010110001001 |
| Octal (base 8) | 142611 |
| Hexadecimal (base 16) | C589 |
| Base 3 | 2120100221 |
| As time | 50569 seconds = 14 h 2 min 49 s |
Is 50569 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50569 a prime number?
No. 50569 = 61 × 829, so it is divisible by 61.
What are the factors of 50569?
1, 61, 829, 50569.
What is 50569 in binary?
1100010110001001 (hexadecimal C589, octal 142611).
What is the square root of 50569?
About 224.8755.
Is 50569 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 50569?
50569 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 829, the product of two primes.