The number 49270
49270 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 379. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 130, 379, 758, 1895, 3790, 4927, 9854, 24635, 49270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49270 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49270 is composite. Its prime factorisation is
- 3
The divisors add up to 95760; without 49270 itself that is 46490, so 49270 is deficient (46490 is less than 49270). Euler's totient φ(49270) = 18144 numbers up to 49270 share no factor with it.
- 4
The digits of 49270 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49270 = 2 \times 5 \times 13 \times 379 \]
49270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 95760 |
| Euler totient φ(n) | 18144 |
| Square | 2427532900 |
| Cube | 119604545983000 |
| Square root | 221.968466 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.927 × |
49270 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and seventy |
| Binary (base 2) | 1100000001110110 |
| Octal (base 8) | 140166 |
| Hexadecimal (base 16) | C076 |
| Base 3 | 2111120211 |
| As time | 49270 seconds = 13 h 41 min 10 s |
Is 49270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49270 ÷ 2 = 24635) | 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 (49270 ÷ 5 = 9854) | 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 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 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49270 ÷ 10 = 4927) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49270 a prime number?
No. 49270 = 2 × 5 × 13 × 379, so it is divisible by 2.
What are the factors of 49270?
1, 2, 5, 10, 13, 26, 65, 130, 379, 758, 1895, 3790, 4927, 9854, 24635, 49270.
What is 49270 in binary?
1100000001110110 (hexadecimal C076, octal 140166).
What is the square root of 49270?
About 221.9685.
Is 49270 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49270?
It is a composite number with 16 divisors.