The number 49360
49360 is a composite number with 20 divisors. Its prime factorisation is × 5 × 617. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 617, 1234, 2468, 3085, 4936, 6170 … 49360.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49360 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49360 is composite. Its prime factorisation is
- 3
The divisors add up to 114948; without 49360 itself that is 65588, so 49360 is abundant (65588 is more than 49360). Euler's totient φ(49360) = 19712 numbers up to 49360 share no factor with it.
- 4
The digits of 49360 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49360 = 2^{4} \times 5 \times 617 \]49360 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 114948 |
| Euler totient φ(n) | 19712 |
| Square | 2436409600 |
| Cube | 120261177856000 |
| Square root | 222.171105 (= 4√3085) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.936 × |
49360 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and sixty |
| Binary (base 2) | 1100000011010000 |
| Octal (base 8) | 140320 |
| Hexadecimal (base 16) | C0D0 |
| Base 3 | 2111201011 |
| As time | 49360 seconds = 13 h 42 min 40 s |
Is 49360 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49360 ÷ 2 = 24680) | 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 | Yes (49360 ÷ 4 = 12340) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49360 ÷ 5 = 9872) | 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 | Yes (49360 ÷ 8 = 6170) | 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 (49360 ÷ 10 = 4936) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49360 a prime number?
No. 49360 = × 5 × 617, so it is divisible by 2.
What are the factors of 49360?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 617, 1234, 2468, 3085, 4936, 6170, 9872, 12340, 24680, 49360.
What is 49360 in binary?
1100000011010000 (hexadecimal C0D0, octal 140320).
What is the square root of 49360?
About 222.1711, exactly 4√3085.
Is 49360 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49360?
It is a composite number with 20 divisors.