The number 49568
49568 is a composite number with 12 divisors. Its prime factorisation is × 1549. Divisors (12): 1, 2, 4, 8, 16, 32, 1549, 3098, 6196, 12392, 24784, 49568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49568: a Harshad number: divisible by its digit sum 32.
- 2
49568 is composite. Its prime factorisation is
- 3
The divisors add up to 97650; without 49568 itself that is 48082, so 49568 is deficient (48082 is less than 49568). Euler's totient φ(49568) = 24768 numbers up to 49568 share no factor with it.
- 4
The digits of 49568 add up to 32, 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
\[ 49568 = 2^{5} \times 1549 \]49568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 97650 |
| Euler totient φ(n) | 24768 |
| Square | 2456986624 |
| Cube | 121787912978432 |
| Square root | 222.638721 (= 4√3098) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9568 × |
49568 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty-eight |
| Binary (base 2) | 1100000110100000 |
| Octal (base 8) | 140640 |
| Hexadecimal (base 16) | C1A0 |
| Base 3 | 2111222212 |
| As time | 49568 seconds = 13 h 46 min 8 s |
Is 49568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49568 ÷ 2 = 24784) | 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 | Yes (49568 ÷ 4 = 12392) | 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 2) | 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 | Yes (49568 ÷ 8 = 6196) | 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 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49568 a prime number?
No. 49568 = × 1549, so it is divisible by 2.
What are the factors of 49568?
1, 2, 4, 8, 16, 32, 1549, 3098, 6196, 12392, 24784, 49568.
What is 49568 in binary?
1100000110100000 (hexadecimal C1A0, octal 140640).
What is the square root of 49568?
About 222.6387, exactly 4√3098.
Is 49568 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 49568?
49568 is a Harshad number: divisible by its digit sum 32.