The number 49504
49504 is a composite number with 48 divisors. Its prime factorisation is × 7 × 13 × 17. Divisors (48): 1, 2, 4, 7, 8, 13, 14, 16, 17, 26, 28, 32, 34, 52, 56, 68 … 49504.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49504 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49504 is composite. Its prime factorisation is
- 3
The divisors add up to 127008; without 49504 itself that is 77504, so 49504 is abundant (77504 is more than 49504). Euler's totient φ(49504) = 18432 numbers up to 49504 share no factor with it.
- 4
The digits of 49504 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49504 = 2^{5} \times 7 \times 13 \times 17 \]49504 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 127008 |
| Euler totient φ(n) | 18432 |
| Square | 2450646016 |
| Cube | 121316780376064 |
| Square root | 222.494944 (= 4√3094) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9504 × |
49504 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and four |
| Binary (base 2) | 1100000101100000 |
| Octal (base 8) | 140540 |
| Hexadecimal (base 16) | C160 |
| Base 3 | 2111220111 |
| As time | 49504 seconds = 13 h 45 min 4 s |
Is 49504 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49504 ÷ 2 = 24752) | 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 (49504 ÷ 4 = 12376) | 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 | Yes (49504 ÷ 7 = 7072) | 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 (49504 ÷ 8 = 6188) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 4) | 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 49504 a prime number?
No. 49504 = × 7 × 13 × 17, so it is divisible by 2.
What are the factors of 49504?
1, 2, 4, 7, 8, 13, 14, 16, 17, 26, 28, 32, 34, 52, 56, 68, 91, 104, 112, 119, 136, 182, 208, 221, 224, 238, 272, 364, 416, 442, 476, 544, 728, 884, 952, 1456, 1547, 1768, 1904, 2912, 3094, 3536, 3808, 6188, 7072, 12376, 24752, 49504.
What is 49504 in binary?
1100000101100000 (hexadecimal C160, octal 140540).
What is the square root of 49504?
About 222.4949, exactly 4√3094.
Is 49504 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49504?
It is a composite number with 48 divisors.