The number 49646
49646 is a composite number with 8 divisors. Its prime factorisation is 2 × 103 × 241. Divisors (8): 1, 2, 103, 206, 241, 482, 24823, 49646.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49646 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49646 is composite. Its prime factorisation is
- 3
The divisors add up to 75504; without 49646 itself that is 25858, so 49646 is deficient (25858 is less than 49646). Euler's totient φ(49646) = 24480 numbers up to 49646 share no factor with it.
- 4
The digits of 49646 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49646 = 2 \times 103 \times 241 \]
49646 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75504 |
| Euler totient φ(n) | 24480 |
| Square | 2464725316 |
| Cube | 122363753038136 |
| Square root | 222.813824 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9646 × |
49646 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and forty-six |
| Binary (base 2) | 1100000111101110 |
| Octal (base 8) | 140756 |
| Hexadecimal (base 16) | C1EE |
| Base 3 | 2112002202 |
| As time | 49646 seconds = 13 h 47 min 26 s |
Is 49646 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49646 ÷ 2 = 24823) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 | No (remainder 2) | 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 | No (remainder 2) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49646 a prime number?
No. 49646 = 2 × 103 × 241, so it is divisible by 2.
What are the factors of 49646?
1, 2, 103, 206, 241, 482, 24823, 49646.
What is 49646 in binary?
1100000111101110 (hexadecimal C1EE, octal 140756).
What is the square root of 49646?
About 222.8138.
Is 49646 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49646?
It is a composite number with 8 divisors.