The number 49358
49358 is a composite number with 16 divisors. Its prime factorisation is 2 × 23 × 29 × 37. Divisors (16): 1, 2, 23, 29, 37, 46, 58, 74, 667, 851, 1073, 1334, 1702, 2146, 24679, 49358.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49358: a Harshad number: divisible by its digit sum 29.
- 2
49358 is composite. Its prime factorisation is
- 3
The divisors add up to 82080; without 49358 itself that is 32722, so 49358 is deficient (32722 is less than 49358). Euler's totient φ(49358) = 22176 numbers up to 49358 share no factor with it.
- 4
The digits of 49358 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49358 = 2 \times 23 \times 29 \times 37 \]
49358 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 82080 |
| Euler totient φ(n) | 22176 |
| Square | 2436212164 |
| Cube | 120246559990712 |
| Square root | 222.166604 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9358 × |
49358 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and fifty-eight |
| Binary (base 2) | 1100000011001110 |
| Octal (base 8) | 140316 |
| Hexadecimal (base 16) | C0CE |
| Base 3 | 2111201002 |
| As time | 49358 seconds = 13 h 42 min 38 s |
Is 49358 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49358 ÷ 2 = 24679) | 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 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 49358 a prime number?
No. 49358 = 2 × 23 × 29 × 37, so it is divisible by 2.
What are the factors of 49358?
1, 2, 23, 29, 37, 46, 58, 74, 667, 851, 1073, 1334, 1702, 2146, 24679, 49358.
What is 49358 in binary?
1100000011001110 (hexadecimal C0CE, octal 140316).
What is the square root of 49358?
About 222.1666.
Is 49358 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49358?
49358 is a Harshad number: divisible by its digit sum 29.