The number 49062
49062 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 13 × 17 × 37. Divisors (32): 1, 2, 3, 6, 13, 17, 26, 34, 37, 39, 51, 74, 78, 102, 111, 221 … 49062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49062 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49062 is composite. Its prime factorisation is
- 3
The divisors add up to 114912; without 49062 itself that is 65850, so 49062 is abundant (65850 is more than 49062). Euler's totient φ(49062) = 13824 numbers up to 49062 share no factor with it.
- 4
The digits of 49062 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49062 = 2 \times 3 \times 13 \times 17 \times 37 \]
49062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 114912 |
| Euler totient φ(n) | 13824 |
| Square | 2407079844 |
| Cube | 118096151306328 |
| Square root | 221.499436 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9062 × |
49062 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and sixty-two |
| Binary (base 2) | 1011111110100110 |
| Octal (base 8) | 137646 |
| Hexadecimal (base 16) | BFA6 |
| Base 3 | 2111022010 |
| As time | 49062 seconds = 13 h 37 min 42 s |
Is 49062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49062 ÷ 2 = 24531) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49062 ÷ 3 = 16354) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49062 ÷ 6 = 8177) | 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 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 49062 a prime number?
No. 49062 = 2 × 3 × 13 × 17 × 37, so it is divisible by 2.
What are the factors of 49062?
1, 2, 3, 6, 13, 17, 26, 34, 37, 39, 51, 74, 78, 102, 111, 221, 222, 442, 481, 629, 663, 962, 1258, 1326, 1443, 1887, 2886, 3774, 8177, 16354, 24531, 49062.
What is 49062 in binary?
1011111110100110 (hexadecimal BFA6, octal 137646).
What is the square root of 49062?
About 221.4994.
Is 49062 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49062?
It is a composite number with 32 divisors.