The number 49563
49563 is a composite number with 6 divisors. Its prime factorisation is × 5507. Divisors (6): 1, 3, 9, 5507, 16521, 49563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49563: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49563 is composite. Its prime factorisation is
- 3
The divisors add up to 71604; without 49563 itself that is 22041, so 49563 is deficient (22041 is less than 49563). Euler's totient φ(49563) = 33036 numbers up to 49563 share no factor with it.
- 4
The digits of 49563 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49563 = 3^{2} \times 5507 \]49563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 71604 |
| Euler totient φ(n) | 33036 |
| Square | 2456490969 |
| Cube | 121751061896547 |
| Square root | 222.627492 (= 3√5507) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 140 |
| Scientific notation | 4.9563 × |
49563 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty-three |
| Binary (base 2) | 1100000110011011 |
| Octal (base 8) | 140633 |
| Hexadecimal (base 16) | C19B |
| Base 3 | 2111222200 |
| As time | 49563 seconds = 13 h 46 min 3 s |
Is 49563 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 (49563 ÷ 3 = 16521) | 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 3) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49563 ÷ 9 = 5507) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49563 a prime number?
No. 49563 = × 5507, so it is divisible by 3.
What are the factors of 49563?
1, 3, 9, 5507, 16521, 49563.
What is 49563 in binary?
1100000110011011 (hexadecimal C19B, octal 140633).
What is the square root of 49563?
About 222.6275, exactly 3√5507.
Is 49563 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49563?
49563 is a happy number: repeatedly adding the squares of its digits reaches 1.