The number 49136
49136 is a composite number with 20 divisors. Its prime factorisation is × 37 × 83. Divisors (20): 1, 2, 4, 8, 16, 37, 74, 83, 148, 166, 296, 332, 592, 664, 1328, 3071 … 49136.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49136 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49136 is composite. Its prime factorisation is
- 3
The divisors add up to 98952; without 49136 itself that is 49816, so 49136 is abundant (49816 is more than 49136). Euler's totient φ(49136) = 23616 numbers up to 49136 share no factor with it.
- 4
The digits of 49136 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49136 = 2^{4} \times 37 \times 83 \]49136 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 98952 |
| Euler totient φ(n) | 23616 |
| Square | 2414346496 |
| Cube | 118631329427456 |
| Square root | 221.666416 (= 4√3071) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9136 × |
49136 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and thirty-six |
| Binary (base 2) | 1011111111110000 |
| Octal (base 8) | 137760 |
| Hexadecimal (base 16) | BFF0 |
| Base 3 | 2111101212 |
| As time | 49136 seconds = 13 h 38 min 56 s |
Is 49136 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49136 ÷ 2 = 24568) | 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 (49136 ÷ 4 = 12284) | 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 2) | 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 (49136 ÷ 8 = 6142) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 49136 a prime number?
No. 49136 = × 37 × 83, so it is divisible by 2.
What are the factors of 49136?
1, 2, 4, 8, 16, 37, 74, 83, 148, 166, 296, 332, 592, 664, 1328, 3071, 6142, 12284, 24568, 49136.
What is 49136 in binary?
1011111111110000 (hexadecimal BFF0, octal 137760).
What is the square root of 49136?
About 221.6664, exactly 4√3071.
Is 49136 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49136?
It is a composite number with 20 divisors.