The number 49456
49456 is a composite number with 20 divisors. Its prime factorisation is × 11 × 281. Divisors (20): 1, 2, 4, 8, 11, 16, 22, 44, 88, 176, 281, 562, 1124, 2248, 3091, 4496 … 49456.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49456 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49456 is composite. Its prime factorisation is
- 3
The divisors add up to 104904; without 49456 itself that is 55448, so 49456 is abundant (55448 is more than 49456). Euler's totient φ(49456) = 22400 numbers up to 49456 share no factor with it.
- 4
The digits of 49456 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
\[ 49456 = 2^{4} \times 11 \times 281 \]49456 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 104904 |
| Euler totient φ(n) | 22400 |
| Square | 2445895936 |
| Cube | 120964229410816 |
| Square root | 222.387050 (= 4√3091) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9456 × |
49456 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and fifty-six |
| Binary (base 2) | 1100000100110000 |
| Octal (base 8) | 140460 |
| Hexadecimal (base 16) | C130 |
| Base 3 | 2111211201 |
| As time | 49456 seconds = 13 h 44 min 16 s |
Is 49456 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49456 ÷ 2 = 24728) | 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 (49456 ÷ 4 = 12364) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 (49456 ÷ 8 = 6182) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49456 ÷ 11 = 4496) | 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 49456 a prime number?
No. 49456 = × 11 × 281, so it is divisible by 2.
What are the factors of 49456?
1, 2, 4, 8, 11, 16, 22, 44, 88, 176, 281, 562, 1124, 2248, 3091, 4496, 6182, 12364, 24728, 49456.
What is 49456 in binary?
1100000100110000 (hexadecimal C130, octal 140460).
What is the square root of 49456?
About 222.3870, exactly 4√3091.
Is 49456 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49456?
It is a composite number with 20 divisors.