The number 49132
49132 is a composite number with 12 divisors. Its prime factorisation is × 71 × 173. Divisors (12): 1, 2, 4, 71, 142, 173, 284, 346, 692, 12283, 24566, 49132.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49132 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49132 is composite. Its prime factorisation is
- 3
The divisors add up to 87696; without 49132 itself that is 38564, so 49132 is deficient (38564 is less than 49132). Euler's totient φ(49132) = 24080 numbers up to 49132 share no factor with it.
- 4
The digits of 49132 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49132 = 2^{2} \times 71 \times 173 \]49132 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87696 |
| Euler totient φ(n) | 24080 |
| Square | 2413953424 |
| Cube | 118602359627968 |
| Square root | 221.657393 (= 2√12283) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9132 × |
49132 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and thirty-two |
| Binary (base 2) | 1011111111101100 |
| Octal (base 8) | 137754 |
| Hexadecimal (base 16) | BFEC |
| Base 3 | 2111101201 |
| As time | 49132 seconds = 13 h 38 min 52 s |
Is 49132 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49132 ÷ 2 = 24566) | 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 (49132 ÷ 4 = 12283) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | 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 6) | 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 49132 a prime number?
No. 49132 = × 71 × 173, so it is divisible by 2.
What are the factors of 49132?
1, 2, 4, 71, 142, 173, 284, 346, 692, 12283, 24566, 49132.
What is 49132 in binary?
1011111111101100 (hexadecimal BFEC, octal 137754).
What is the square root of 49132?
About 221.6574, exactly 2√12283.
Is 49132 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 49132?
It is a composite number with 12 divisors.