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