The number 49533
49533 is a composite number with 16 divisors. Its prime factorisation is 3 × 11 × 19 × 79. Divisors (16): 1, 3, 11, 19, 33, 57, 79, 209, 237, 627, 869, 1501, 2607, 4503, 16511, 49533.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49533 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49533 is composite. Its prime factorisation is
- 3
The divisors add up to 76800; without 49533 itself that is 27267, so 49533 is deficient (27267 is less than 49533). Euler's totient φ(49533) = 28080 numbers up to 49533 share no factor with it.
- 4
The digits of 49533 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49533 = 3 \times 11 \times 19 \times 79 \]
49533 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 76800 |
| Euler totient φ(n) | 28080 |
| Square | 2453518089 |
| Cube | 121530111502437 |
| Square root | 222.560104 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 171 |
| Scientific notation | 4.9533 × |
49533 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and thirty-three |
| Binary (base 2) | 1100000101111101 |
| Octal (base 8) | 140575 |
| Hexadecimal (base 16) | C17D |
| Base 3 | 2111221120 |
| As time | 49533 seconds = 13 h 45 min 33 s |
Is 49533 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 (49533 ÷ 3 = 16511) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49533 ÷ 11 = 4503) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49533 a prime number?
No. 49533 = 3 × 11 × 19 × 79, so it is divisible by 3.
What are the factors of 49533?
1, 3, 11, 19, 33, 57, 79, 209, 237, 627, 869, 1501, 2607, 4503, 16511, 49533.
What is 49533 in binary?
1100000101111101 (hexadecimal C17D, octal 140575).
What is the square root of 49533?
About 222.5601.
Is 49533 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49533?
It is a composite number with 16 divisors.