The number 49092
49092 is a composite number with 12 divisors. Its prime factorisation is × 3 × 4091. Divisors (12): 1, 2, 3, 4, 6, 12, 4091, 8182, 12273, 16364, 24546, 49092.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49092 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49092 is composite. Its prime factorisation is
- 3
The divisors add up to 114576; without 49092 itself that is 65484, so 49092 is abundant (65484 is more than 49092). Euler's totient φ(49092) = 16360 numbers up to 49092 share no factor with it.
- 4
The digits of 49092 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49092 = 2^{2} \times 3 \times 4091 \]49092 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 114576 |
| Euler totient φ(n) | 16360 |
| Square | 2410024464 |
| Cube | 118312920986688 |
| Square root | 221.567146 (= 2√12273) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9092 × |
49092 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and ninety-two |
| Binary (base 2) | 1011111111000100 |
| Octal (base 8) | 137704 |
| Hexadecimal (base 16) | BFC4 |
| Base 3 | 2111100020 |
| As time | 49092 seconds = 13 h 38 min 12 s |
Is 49092 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49092 ÷ 2 = 24546) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49092 ÷ 3 = 16364) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49092 ÷ 4 = 12273) | 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 | Yes (49092 ÷ 6 = 8182) | 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 6) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (49092 ÷ 12 = 4091) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49092 a prime number?
No. 49092 = × 3 × 4091, so it is divisible by 2.
What are the factors of 49092?
1, 2, 3, 4, 6, 12, 4091, 8182, 12273, 16364, 24546, 49092.
What is 49092 in binary?
1011111111000100 (hexadecimal BFC4, octal 137704).
What is the square root of 49092?
About 221.5671, exactly 2√12273.
Is 49092 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49092?
It is a composite number with 12 divisors.