The number 49592
49592 is a composite number with 8 divisors. Its prime factorisation is × 6199. Divisors (8): 1, 2, 4, 8, 6199, 12398, 24796, 49592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49592 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49592 is composite. Its prime factorisation is
- 3
The divisors add up to 93000; without 49592 itself that is 43408, so 49592 is deficient (43408 is less than 49592). Euler's totient φ(49592) = 24792 numbers up to 49592 share no factor with it.
- 4
The digits of 49592 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49592 = 2^{3} \times 6199 \]49592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 93000 |
| Euler totient φ(n) | 24792 |
| Square | 2459366464 |
| Cube | 121964901682688 |
| Square root | 222.692613 (= 2√12398) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 4.9592 × |
49592 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and ninety-two |
| Binary (base 2) | 1100000110111000 |
| Octal (base 8) | 140670 |
| Hexadecimal (base 16) | C1B8 |
| Base 3 | 2112000202 |
| As time | 49592 seconds = 13 h 46 min 32 s |
Is 49592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49592 ÷ 2 = 24796) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49592 ÷ 4 = 12398) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (49592 ÷ 8 = 6199) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49592 a prime number?
No. 49592 = × 6199, so it is divisible by 2.
What are the factors of 49592?
1, 2, 4, 8, 6199, 12398, 24796, 49592.
What is 49592 in binary?
1100000110111000 (hexadecimal C1B8, octal 140670).
What is the square root of 49592?
About 222.6926, exactly 2√12398.
Is 49592 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49592?
It is a composite number with 8 divisors.