The number 49651
49651 is a composite number with 8 divisors. Its prime factorisation is 7 × 41 × 173. Divisors (8): 1, 7, 41, 173, 287, 1211, 7093, 49651.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49651 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49651 is composite. Its prime factorisation is
- 3
The divisors add up to 58464; without 49651 itself that is 8813, so 49651 is deficient (8813 is less than 49651). Euler's totient φ(49651) = 41280 numbers up to 49651 share no factor with it.
- 4
The digits of 49651 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49651 = 7 \times 41 \times 173 \]
49651 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58464 |
| Euler totient φ(n) | 41280 |
| Square | 2465221801 |
| Cube | 122400727641451 |
| Square root | 222.825043 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9651 × |
49651 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and fifty-one |
| Binary (base 2) | 1100000111110011 |
| Octal (base 8) | 140763 |
| Hexadecimal (base 16) | C1F3 |
| Base 3 | 2112002221 |
| As time | 49651 seconds = 13 h 47 min 31 s |
Is 49651 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49651 ÷ 7 = 7093) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49651 a prime number?
No. 49651 = 7 × 41 × 173, so it is divisible by 7.
What are the factors of 49651?
1, 7, 41, 173, 287, 1211, 7093, 49651.
What is 49651 in binary?
1100000111110011 (hexadecimal C1F3, octal 140763).
What is the square root of 49651?
About 222.8250.
Is 49651 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49651?
It is a composite number with 8 divisors.