The number 49593
49593 is a composite number with 8 divisors. Its prime factorisation is 3 × 61 × 271. Divisors (8): 1, 3, 61, 183, 271, 813, 16531, 49593.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49593 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49593 is composite. Its prime factorisation is
- 3
The divisors add up to 67456; without 49593 itself that is 17863, so 49593 is deficient (17863 is less than 49593). Euler's totient φ(49593) = 32400 numbers up to 49593 share no factor with it.
- 4
The digits of 49593 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49593 = 3 \times 61 \times 271 \]
49593 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67456 |
| Euler totient φ(n) | 32400 |
| Square | 2459465649 |
| Cube | 121972279930857 |
| Square root | 222.694858 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9593 × |
49593 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and ninety-three |
| Binary (base 2) | 1100000110111001 |
| Octal (base 8) | 140671 |
| Hexadecimal (base 16) | C1B9 |
| Base 3 | 2112000210 |
| As time | 49593 seconds = 13 h 46 min 33 s |
Is 49593 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 (49593 ÷ 3 = 16531) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | No (remainder 5) | 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 49593 a prime number?
No. 49593 = 3 × 61 × 271, so it is divisible by 3.
What are the factors of 49593?
1, 3, 61, 183, 271, 813, 16531, 49593.
What is 49593 in binary?
1100000110111001 (hexadecimal C1B9, octal 140671).
What is the square root of 49593?
About 222.6949.
Is 49593 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49593?
It is a composite number with 8 divisors.