The number 49030
49030 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 4903. Divisors (8): 1, 2, 5, 10, 4903, 9806, 24515, 49030.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49030 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49030 is composite. Its prime factorisation is
- 3
The divisors add up to 88272; without 49030 itself that is 39242, so 49030 is deficient (39242 is less than 49030). Euler's totient φ(49030) = 19608 numbers up to 49030 share no factor with it.
- 4
The digits of 49030 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49030 = 2 \times 5 \times 4903 \]
49030 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88272 |
| Euler totient φ(n) | 19608 |
| Square | 2403940900 |
| Cube | 117865222327000 |
| Square root | 221.427189 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.903 × |
49030 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and thirty |
| Binary (base 2) | 1011111110000110 |
| Octal (base 8) | 137606 |
| Hexadecimal (base 16) | BF86 |
| Base 3 | 2111020221 |
| As time | 49030 seconds = 13 h 37 min 10 s |
Is 49030 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49030 ÷ 2 = 24515) | 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 (49030 ÷ 5 = 9806) | 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 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49030 ÷ 10 = 4903) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49030 a prime number?
No. 49030 = 2 × 5 × 4903, so it is divisible by 2.
What are the factors of 49030?
1, 2, 5, 10, 4903, 9806, 24515, 49030.
What is 49030 in binary?
1011111110000110 (hexadecimal BF86, octal 137606).
What is the square root of 49030?
About 221.4272.
Is 49030 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 49030?
It is a composite number with 8 divisors.