The number 49506
49506 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 37 × 223. Divisors (16): 1, 2, 3, 6, 37, 74, 111, 222, 223, 446, 669, 1338, 8251, 16502, 24753, 49506.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49506 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49506 is composite. Its prime factorisation is
- 3
The divisors add up to 102144; without 49506 itself that is 52638, so 49506 is abundant (52638 is more than 49506). Euler's totient φ(49506) = 15984 numbers up to 49506 share no factor with it.
- 4
The digits of 49506 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49506 = 2 \times 3 \times 37 \times 223 \]
49506 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 102144 |
| Euler totient φ(n) | 15984 |
| Square | 2450844036 |
| Cube | 121331484846216 |
| Square root | 222.499438 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9506 × |
49506 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and six |
| Binary (base 2) | 1100000101100010 |
| Octal (base 8) | 140542 |
| Hexadecimal (base 16) | C162 |
| Base 3 | 2111220120 |
| As time | 49506 seconds = 13 h 45 min 6 s |
Is 49506 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49506 ÷ 2 = 24753) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49506 ÷ 3 = 16502) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49506 ÷ 6 = 8251) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49506 a prime number?
No. 49506 = 2 × 3 × 37 × 223, so it is divisible by 2.
What are the factors of 49506?
1, 2, 3, 6, 37, 74, 111, 222, 223, 446, 669, 1338, 8251, 16502, 24753, 49506.
What is 49506 in binary?
1100000101100010 (hexadecimal C162, octal 140542).
What is the square root of 49506?
About 222.4994.
Is 49506 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49506?
It is a composite number with 16 divisors.