The number 49060
49060 is a composite number with 24 divisors. Its prime factorisation is × 5 × 11 × 223. Divisors (24): 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 223, 446, 892, 1115 … 49060.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49060: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49060 is composite. Its prime factorisation is
- 3
The divisors add up to 112896; without 49060 itself that is 63836, so 49060 is abundant (63836 is more than 49060). Euler's totient φ(49060) = 17760 numbers up to 49060 share no factor with it.
- 4
The digits of 49060 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49060 = 2^{2} \times 5 \times 11 \times 223 \]49060 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 112896 |
| Euler totient φ(n) | 17760 |
| Square | 2406883600 |
| Cube | 118081709416000 |
| Square root | 221.494921 (= 2√12265) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.906 × |
49060 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and sixty |
| Binary (base 2) | 1011111110100100 |
| Octal (base 8) | 137644 |
| Hexadecimal (base 16) | BFA4 |
| Base 3 | 2111022001 |
| As time | 49060 seconds = 13 h 37 min 40 s |
Is 49060 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49060 ÷ 2 = 24530) | 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 | Yes (49060 ÷ 4 = 12265) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49060 ÷ 5 = 9812) | 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 4) | 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 4) | 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 (49060 ÷ 10 = 4906) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49060 ÷ 11 = 4460) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49060 a prime number?
No. 49060 = × 5 × 11 × 223, so it is divisible by 2.
What are the factors of 49060?
1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 223, 446, 892, 1115, 2230, 2453, 4460, 4906, 9812, 12265, 24530, 49060.
What is 49060 in binary?
1011111110100100 (hexadecimal BFA4, octal 137644).
What is the square root of 49060?
About 221.4949, exactly 2√12265.
Is 49060 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 49060?
49060 is a happy number: repeatedly adding the squares of its digits reaches 1.