The number 49058
49058 is a composite number with 8 divisors. Its prime factorisation is 2 × 19 × 1291. Divisors (8): 1, 2, 19, 38, 1291, 2582, 24529, 49058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49058 is composite. Its prime factorisation is
- 3
The divisors add up to 77520; without 49058 itself that is 28462, so 49058 is deficient (28462 is less than 49058). Euler's totient φ(49058) = 23220 numbers up to 49058 share no factor with it.
- 4
The digits of 49058 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49058 = 2 \times 19 \times 1291 \]
49058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77520 |
| Euler totient φ(n) | 23220 |
| Square | 2406687364 |
| Cube | 118067268703112 |
| Square root | 221.490406 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9058 × |
49058 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and fifty-eight |
| Binary (base 2) | 1011111110100010 |
| Octal (base 8) | 137642 |
| Hexadecimal (base 16) | BFA2 |
| Base 3 | 2111021222 |
| As time | 49058 seconds = 13 h 37 min 38 s |
Is 49058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49058 ÷ 2 = 24529) | 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 | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49058 a prime number?
No. 49058 = 2 × 19 × 1291, so it is divisible by 2.
What are the factors of 49058?
1, 2, 19, 38, 1291, 2582, 24529, 49058.
What is 49058 in binary?
1011111110100010 (hexadecimal BFA2, octal 137642).
What is the square root of 49058?
About 221.4904.
Is 49058 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49058?
It is a composite number with 8 divisors.