The number 49594
49594 is a palindrome: it reads 49594 backwards too. Its prime factorisation is 2 × 137 × 181. Divisors (8): 1, 2, 137, 181, 274, 362, 24797, 49594.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49594: a palindrome: it reads 49594 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49594 is composite. Its prime factorisation is
- 3
The divisors add up to 75348; without 49594 itself that is 25754, so 49594 is deficient (25754 is less than 49594). Euler's totient φ(49594) = 24480 numbers up to 49594 share no factor with it.
- 4
The digits of 49594 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49594 = 2 \times 137 \times 181 \]
49594 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75348 |
| Euler totient φ(n) | 24480 |
| Square | 2459564836 |
| Cube | 121979658476584 |
| Square root | 222.697104 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 140 |
| Scientific notation | 4.9594 × |
49594 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and ninety-four |
| Binary (base 2) | 1100000110111010 |
| Octal (base 8) | 140672 |
| Hexadecimal (base 16) | C1BA |
| Base 3 | 2112000211 |
| As time | 49594 seconds = 13 h 46 min 34 s |
Is 49594 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49594 ÷ 2 = 24797) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49594 a prime number?
No. 49594 = 2 × 137 × 181, so it is divisible by 2.
What are the factors of 49594?
1, 2, 137, 181, 274, 362, 24797, 49594.
What is 49594 in binary?
1100000110111010 (hexadecimal C1BA, octal 140672).
What is the square root of 49594?
About 222.6971.
Is 49594 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49594?
49594 is a palindrome: it reads 49594 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.