The number 49590
49590 is a composite number with 48 divisors. Its prime factorisation is 2 × × 5 × 19 × 29. Divisors (48): 1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 29, 30, 38, 45, 57, 58 … 49590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49590: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49590 is composite. Its prime factorisation is
- 3
The divisors add up to 140400; without 49590 itself that is 90810, so 49590 is abundant (90810 is more than 49590). Euler's totient φ(49590) = 12096 numbers up to 49590 share no factor with it.
- 4
The digits of 49590 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49590 = 2 \times 3^{2} \times 5 \times 19 \times 29 \]49590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 140400 |
| Euler totient φ(n) | 12096 |
| Square | 2459168100 |
| Cube | 121950146079000 |
| Square root | 222.688123 (= 3√5510) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.959 × |
49590 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and ninety |
| Binary (base 2) | 1100000110110110 |
| Octal (base 8) | 140666 |
| Hexadecimal (base 16) | C1B6 |
| Base 3 | 2112000200 |
| As time | 49590 seconds = 13 h 46 min 30 s |
Is 49590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49590 ÷ 2 = 24795) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49590 ÷ 3 = 16530) | 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 (49590 ÷ 5 = 9918) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49590 ÷ 6 = 8265) | 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 | Yes (49590 ÷ 9 = 5510) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49590 ÷ 10 = 4959) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 49590 a prime number?
No. 49590 = 2 × × 5 × 19 × 29, so it is divisible by 2.
What are the factors of 49590?
1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 29, 30, 38, 45, 57, 58, 87, 90, 95, 114, 145, 171, 174, 190, 261, 285, 290, 342, 435, 522, 551, 570, 855, 870, 1102, 1305, 1653, 1710, 2610, 2755, 3306, 4959, 5510, 8265, 9918, 16530, 24795, 49590.
What is 49590 in binary?
1100000110110110 (hexadecimal C1B6, octal 140666).
What is the square root of 49590?
About 222.6881, exactly 3√5510.
Is 49590 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49590?
49590 is a happy number: repeatedly adding the squares of its digits reaches 1.