The number 49230
49230 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 547. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 547, 1094, 1641, 2735 … 49230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49230: a Harshad number: divisible by its digit sum 18.
- 2
49230 is composite. Its prime factorisation is
- 3
The divisors add up to 128232; without 49230 itself that is 79002, so 49230 is abundant (79002 is more than 49230). Euler's totient φ(49230) = 13104 numbers up to 49230 share no factor with it.
- 4
The digits of 49230 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49230 = 2 \times 3^{2} \times 5 \times 547 \]49230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 128232 |
| Euler totient φ(n) | 13104 |
| Square | 2423592900 |
| Cube | 119313478467000 |
| Square root | 221.878345 (= 3√5470) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.923 × |
49230 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and thirty |
| Binary (base 2) | 1100000001001110 |
| Octal (base 8) | 140116 |
| Hexadecimal (base 16) | C04E |
| Base 3 | 2111112100 |
| As time | 49230 seconds = 13 h 40 min 30 s |
Is 49230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49230 ÷ 2 = 24615) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49230 ÷ 3 = 16410) | 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 (49230 ÷ 5 = 9846) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49230 ÷ 6 = 8205) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (49230 ÷ 9 = 5470) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49230 ÷ 10 = 4923) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49230 a prime number?
No. 49230 = 2 × × 5 × 547, so it is divisible by 2.
What are the factors of 49230?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 547, 1094, 1641, 2735, 3282, 4923, 5470, 8205, 9846, 16410, 24615, 49230.
What is 49230 in binary?
1100000001001110 (hexadecimal C04E, octal 140116).
What is the square root of 49230?
About 221.8783, exactly 3√5470.
Is 49230 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 49230?
49230 is a Harshad number: divisible by its digit sum 18.