The number 49158
49158 is a composite number with 12 divisors. Its prime factorisation is 2 × × 2731. Divisors (12): 1, 2, 3, 6, 9, 18, 2731, 5462, 8193, 16386, 24579, 49158.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49158 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49158 is composite. Its prime factorisation is
- 3
The divisors add up to 106548; without 49158 itself that is 57390, so 49158 is abundant (57390 is more than 49158). Euler's totient φ(49158) = 16380 numbers up to 49158 share no factor with it.
- 4
The digits of 49158 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49158 = 2 \times 3^{2} \times 2731 \]49158 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 106548 |
| Euler totient φ(n) | 16380 |
| Square | 2416508964 |
| Cube | 118790747652312 |
| Square root | 221.716035 (= 3√5462) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9158 × |
49158 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and fifty-eight |
| Binary (base 2) | 1100000000000110 |
| Octal (base 8) | 140006 |
| Hexadecimal (base 16) | C006 |
| Base 3 | 2111102200 |
| As time | 49158 seconds = 13 h 39 min 18 s |
Is 49158 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49158 ÷ 2 = 24579) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49158 ÷ 3 = 16386) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49158 ÷ 6 = 8193) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49158 ÷ 9 = 5462) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49158 a prime number?
No. 49158 = 2 × × 2731, so it is divisible by 2.
What are the factors of 49158?
1, 2, 3, 6, 9, 18, 2731, 5462, 8193, 16386, 24579, 49158.
What is 49158 in binary?
1100000000000110 (hexadecimal C006, octal 140006).
What is the square root of 49158?
About 221.7160, exactly 3√5462.
Is 49158 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49158?
It is a composite number with 12 divisors.