The number 49570
49570 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 4957. Divisors (8): 1, 2, 5, 10, 4957, 9914, 24785, 49570.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49570 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49570 is composite. Its prime factorisation is
- 3
The divisors add up to 89244; without 49570 itself that is 39674, so 49570 is deficient (39674 is less than 49570). Euler's totient φ(49570) = 19824 numbers up to 49570 share no factor with it.
- 4
The digits of 49570 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49570 = 2 \times 5 \times 4957 \]
49570 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 89244 |
| Euler totient φ(n) | 19824 |
| Square | 2457184900 |
| Cube | 121802655493000 |
| Square root | 222.643212 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.957 × |
49570 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and seventy |
| Binary (base 2) | 1100000110100010 |
| Octal (base 8) | 140642 |
| Hexadecimal (base 16) | C1A2 |
| Base 3 | 2111222221 |
| As time | 49570 seconds = 13 h 46 min 10 s |
Is 49570 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49570 ÷ 2 = 24785) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49570 ÷ 5 = 9914) | 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 3) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49570 ÷ 10 = 4957) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49570 a prime number?
No. 49570 = 2 × 5 × 4957, so it is divisible by 2.
What are the factors of 49570?
1, 2, 5, 10, 4957, 9914, 24785, 49570.
What is 49570 in binary?
1100000110100010 (hexadecimal C1A2, octal 140642).
What is the square root of 49570?
About 222.6432.
Is 49570 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49570?
It is a composite number with 8 divisors.