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