The number 49370
49370 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 4937. Divisors (8): 1, 2, 5, 10, 4937, 9874, 24685, 49370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49370 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49370 is composite. Its prime factorisation is
- 3
The divisors add up to 88884; without 49370 itself that is 39514, so 49370 is deficient (39514 is less than 49370). Euler's totient φ(49370) = 19744 numbers up to 49370 share no factor with it.
- 4
The digits of 49370 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 264 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49370 = 2 \times 5 \times 4937 \]
49370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88884 |
| Euler totient φ(n) | 19744 |
| Square | 2437396900 |
| Cube | 120334284953000 |
| Square root | 222.193609 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 264 |
| Scientific notation | 4.937 × |
49370 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and seventy |
| Binary (base 2) | 1100000011011010 |
| Octal (base 8) | 140332 |
| Hexadecimal (base 16) | C0DA |
| Base 3 | 2111201112 |
| As time | 49370 seconds = 13 h 42 min 50 s |
Is 49370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49370 ÷ 2 = 24685) | 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 | Yes (49370 ÷ 5 = 9874) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49370 ÷ 10 = 4937) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 49370 a prime number?
No. 49370 = 2 × 5 × 4937, so it is divisible by 2.
What are the factors of 49370?
1, 2, 5, 10, 4937, 9874, 24685, 49370.
What is 49370 in binary?
1100000011011010 (hexadecimal C0DA, octal 140332).
What is the square root of 49370?
About 222.1936.
Is 49370 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49370?
It is a composite number with 8 divisors.