The number 49052
49052 is a composite number with 6 divisors. Its prime factorisation is × 12263. Divisors (6): 1, 2, 4, 12263, 24526, 49052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49052 is composite. Its prime factorisation is
- 3
The divisors add up to 85848; without 49052 itself that is 36796, so 49052 is deficient (36796 is less than 49052). Euler's totient φ(49052) = 24524 numbers up to 49052 share no factor with it.
- 4
The digits of 49052 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49052 = 2^{2} \times 12263 \]49052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 85848 |
| Euler totient φ(n) | 24524 |
| Square | 2406098704 |
| Cube | 118023953628608 |
| Square root | 221.476861 (= 2√12263) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.9052 × |
49052 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and fifty-two |
| Binary (base 2) | 1011111110011100 |
| Octal (base 8) | 137634 |
| Hexadecimal (base 16) | BF9C |
| Base 3 | 2111021202 |
| As time | 49052 seconds = 13 h 37 min 32 s |
Is 49052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49052 ÷ 2 = 24526) | 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 (49052 ÷ 4 = 12263) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 49052 a prime number?
No. 49052 = × 12263, so it is divisible by 2.
What are the factors of 49052?
1, 2, 4, 12263, 24526, 49052.
What is 49052 in binary?
1011111110011100 (hexadecimal BF9C, octal 137634).
What is the square root of 49052?
About 221.4769, exactly 2√12263.
Is 49052 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49052?
It is a composite number with 6 divisors.