The number 49036
49036 is a composite number with 24 divisors. Its prime factorisation is × 13 × 23 × 41. Divisors (24): 1, 2, 4, 13, 23, 26, 41, 46, 52, 82, 92, 164, 299, 533, 598, 943 … 49036.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49036 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49036 is composite. Its prime factorisation is
- 3
The divisors add up to 98784; without 49036 itself that is 49748, so 49036 is abundant (49748 is more than 49036). Euler's totient φ(49036) = 21120 numbers up to 49036 share no factor with it.
- 4
The digits of 49036 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49036 = 2^{2} \times 13 \times 23 \times 41 \]49036 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 98784 |
| Euler totient φ(n) | 21120 |
| Square | 2404529296 |
| Cube | 117908498558656 |
| Square root | 221.440737 (= 2√12259) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9036 × |
49036 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and thirty-six |
| Binary (base 2) | 1011111110001100 |
| Octal (base 8) | 137614 |
| Hexadecimal (base 16) | BF8C |
| Base 3 | 2111021011 |
| As time | 49036 seconds = 13 h 37 min 16 s |
Is 49036 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49036 ÷ 2 = 24518) | 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 (49036 ÷ 4 = 12259) | 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 | No (remainder 4) | 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 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 49036 a prime number?
No. 49036 = × 13 × 23 × 41, so it is divisible by 2.
What are the factors of 49036?
1, 2, 4, 13, 23, 26, 41, 46, 52, 82, 92, 164, 299, 533, 598, 943, 1066, 1196, 1886, 2132, 3772, 12259, 24518, 49036.
What is 49036 in binary?
1011111110001100 (hexadecimal BF8C, octal 137614).
What is the square root of 49036?
About 221.4407, exactly 2√12259.
Is 49036 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49036?
It is a composite number with 24 divisors.