The number 49551
49551 is a composite number with 8 divisors. Its prime factorisation is 3 × 83 × 199. Divisors (8): 1, 3, 83, 199, 249, 597, 16517, 49551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49551 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49551 is composite. Its prime factorisation is
- 3
The divisors add up to 67200; without 49551 itself that is 17649, so 49551 is deficient (17649 is less than 49551). Euler's totient φ(49551) = 32472 numbers up to 49551 share no factor with it.
- 4
The digits of 49551 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49551 = 3 \times 83 \times 199 \]
49551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67200 |
| Euler totient φ(n) | 32472 |
| Square | 2455301601 |
| Cube | 121662649631151 |
| Square root | 222.600539 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9551 × |
49551 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and fifty-one |
| Binary (base 2) | 1100000110001111 |
| Octal (base 8) | 140617 |
| Hexadecimal (base 16) | C18F |
| Base 3 | 2111222020 |
| As time | 49551 seconds = 13 h 45 min 51 s |
Is 49551 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 | Yes (49551 ÷ 3 = 16517) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49551 a prime number?
No. 49551 = 3 × 83 × 199, so it is divisible by 3.
What are the factors of 49551?
1, 3, 83, 199, 249, 597, 16517, 49551.
What is 49551 in binary?
1100000110001111 (hexadecimal C18F, octal 140617).
What is the square root of 49551?
About 222.6005.
Is 49551 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49551?
It is a composite number with 8 divisors.