The number 49564
49564 is a composite number with 6 divisors. Its prime factorisation is × 12391. Divisors (6): 1, 2, 4, 12391, 24782, 49564.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49564 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49564 is composite. Its prime factorisation is
- 3
The divisors add up to 86744; without 49564 itself that is 37180, so 49564 is deficient (37180 is less than 49564). Euler's totient φ(49564) = 24780 numbers up to 49564 share no factor with it.
- 4
The digits of 49564 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49564 = 2^{2} \times 12391 \]49564 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 86744 |
| Euler totient φ(n) | 24780 |
| Square | 2456590096 |
| Cube | 121758431518144 |
| Square root | 222.629737 (= 2√12391) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9564 × |
49564 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty-four |
| Binary (base 2) | 1100000110011100 |
| Octal (base 8) | 140634 |
| Hexadecimal (base 16) | C19C |
| Base 3 | 2111222201 |
| As time | 49564 seconds = 13 h 46 min 4 s |
Is 49564 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49564 ÷ 2 = 24782) | 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 | Yes (49564 ÷ 4 = 12391) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49564 a prime number?
No. 49564 = × 12391, so it is divisible by 2.
What are the factors of 49564?
1, 2, 4, 12391, 24782, 49564.
What is 49564 in binary?
1100000110011100 (hexadecimal C19C, octal 140634).
What is the square root of 49564?
About 222.6297, exactly 2√12391.
Is 49564 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49564?
It is a composite number with 6 divisors.