The number 49696
49696 is a composite number with 12 divisors. Its prime factorisation is × 1553. Divisors (12): 1, 2, 4, 8, 16, 32, 1553, 3106, 6212, 12424, 24848, 49696.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49696 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49696 is composite. Its prime factorisation is
- 3
The divisors add up to 97902; without 49696 itself that is 48206, so 49696 is deficient (48206 is less than 49696). Euler's totient φ(49696) = 24832 numbers up to 49696 share no factor with it.
- 4
The digits of 49696 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49696 = 2^{5} \times 1553 \]49696 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 97902 |
| Euler totient φ(n) | 24832 |
| Square | 2469692416 |
| Cube | 122733834305536 |
| Square root | 222.925997 (= 4√3106) |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9696 × |
49696 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and ninety-six |
| Binary (base 2) | 1100001000100000 |
| Octal (base 8) | 141040 |
| Hexadecimal (base 16) | C220 |
| Base 3 | 2112011121 |
| As time | 49696 seconds = 13 h 48 min 16 s |
Is 49696 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49696 ÷ 2 = 24848) | 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 (49696 ÷ 4 = 12424) | 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 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 | Yes (49696 ÷ 8 = 6212) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 | 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 49696 a prime number?
No. 49696 = × 1553, so it is divisible by 2.
What are the factors of 49696?
1, 2, 4, 8, 16, 32, 1553, 3106, 6212, 12424, 24848, 49696.
What is 49696 in binary?
1100001000100000 (hexadecimal C220, octal 141040).
What is the square root of 49696?
About 222.9260, exactly 4√3106.
Is 49696 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 49696?
It is a composite number with 12 divisors.