The number 49569
49569 is a composite number with 16 divisors. Its prime factorisation is 3 × 13 × 31 × 41. Divisors (16): 1, 3, 13, 31, 39, 41, 93, 123, 403, 533, 1209, 1271, 1599, 3813, 16523, 49569.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49569: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49569 is composite. Its prime factorisation is
- 3
The divisors add up to 75264; without 49569 itself that is 25695, so 49569 is deficient (25695 is less than 49569). Euler's totient φ(49569) = 28800 numbers up to 49569 share no factor with it.
- 4
The digits of 49569 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49569 = 3 \times 13 \times 31 \times 41 \]
49569 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 75264 |
| Euler totient φ(n) | 28800 |
| Square | 2457085761 |
| Cube | 121795284087009 |
| Square root | 222.640967 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9569 × |
49569 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty-nine |
| Binary (base 2) | 1100000110100001 |
| Octal (base 8) | 140641 |
| Hexadecimal (base 16) | C1A1 |
| Base 3 | 2111222220 |
| As time | 49569 seconds = 13 h 46 min 9 s |
Is 49569 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 (49569 ÷ 3 = 16523) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49569 a prime number?
No. 49569 = 3 × 13 × 31 × 41, so it is divisible by 3.
What are the factors of 49569?
1, 3, 13, 31, 39, 41, 93, 123, 403, 533, 1209, 1271, 1599, 3813, 16523, 49569.
What is 49569 in binary?
1100000110100001 (hexadecimal C1A1, octal 140641).
What is the square root of 49569?
About 222.6410.
Is 49569 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 49569?
49569 is a happy number: repeatedly adding the squares of its digits reaches 1.