The number 49156
49156 is a composite number with 6 divisors. Its prime factorisation is × 12289. Divisors (6): 1, 2, 4, 12289, 24578, 49156.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49156 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49156 is composite. Its prime factorisation is
- 3
The divisors add up to 86030; without 49156 itself that is 36874, so 49156 is deficient (36874 is less than 49156). Euler's totient φ(49156) = 24576 numbers up to 49156 share no factor with it.
- 4
The digits of 49156 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49156 = 2^{2} \times 12289 \]49156 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 86030 |
| Euler totient φ(n) | 24576 |
| Square | 2416312336 |
| Cube | 118776249188416 |
| Square root | 221.711524 (= 2√12289) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9156 × |
49156 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and fifty-six |
| Binary (base 2) | 1100000000000100 |
| Octal (base 8) | 140004 |
| Hexadecimal (base 16) | C004 |
| Base 3 | 2111102121 |
| As time | 49156 seconds = 13 h 39 min 16 s |
Is 49156 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49156 ÷ 2 = 24578) | 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 (49156 ÷ 4 = 12289) | 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 2) | 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 4) | 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 8) | 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 49156 a prime number?
No. 49156 = × 12289, so it is divisible by 2.
What are the factors of 49156?
1, 2, 4, 12289, 24578, 49156.
What is 49156 in binary?
1100000000000100 (hexadecimal C004, octal 140004).
What is the square root of 49156?
About 221.7115, exactly 2√12289.
Is 49156 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49156?
It is a composite number with 6 divisors.