The number 49460
49460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2473. Divisors (12): 1, 2, 4, 5, 10, 20, 2473, 4946, 9892, 12365, 24730, 49460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49460 is composite. Its prime factorisation is
- 3
The divisors add up to 103908; without 49460 itself that is 54448, so 49460 is abundant (54448 is more than 49460). Euler's totient φ(49460) = 19776 numbers up to 49460 share no factor with it.
- 4
The digits of 49460 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49460 = 2^{2} \times 5 \times 2473 \]49460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 103908 |
| Euler totient φ(n) | 19776 |
| Square | 2446291600 |
| Cube | 120993582536000 |
| Square root | 222.396043 (= 2√12365) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.946 × |
49460 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and sixty |
| Binary (base 2) | 1100000100110100 |
| Octal (base 8) | 140464 |
| Hexadecimal (base 16) | C134 |
| Base 3 | 2111211212 |
| As time | 49460 seconds = 13 h 44 min 20 s |
Is 49460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49460 ÷ 2 = 24730) | 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 | Yes (49460 ÷ 4 = 12365) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49460 ÷ 5 = 9892) | 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 5) | 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 4) | 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 (49460 ÷ 10 = 4946) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49460 a prime number?
No. 49460 = × 5 × 2473, so it is divisible by 2.
What are the factors of 49460?
1, 2, 4, 5, 10, 20, 2473, 4946, 9892, 12365, 24730, 49460.
What is 49460 in binary?
1100000100110100 (hexadecimal C134, octal 140464).
What is the square root of 49460?
About 222.3960, exactly 2√12365.
Is 49460 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49460?
It is a composite number with 12 divisors.