The number 50492
50492 is a composite number with 12 divisors. Its prime factorisation is × 13 × 971. Divisors (12): 1, 2, 4, 13, 26, 52, 971, 1942, 3884, 12623, 25246, 50492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50492 is composite. Its prime factorisation is
- 3
The divisors add up to 95256; without 50492 itself that is 44764, so 50492 is deficient (44764 is less than 50492). Euler's totient φ(50492) = 23280 numbers up to 50492 share no factor with it.
- 4
The digits of 50492 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50492 = 2^{2} \times 13 \times 971 \]50492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 95256 |
| Euler totient φ(n) | 23280 |
| Square | 2549442064 |
| Cube | 128726428695488 |
| Square root | 224.704250 (= 2√12623) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0492 × |
50492 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and ninety-two |
| Binary (base 2) | 1100010100111100 |
| Octal (base 8) | 142474 |
| Hexadecimal (base 16) | C53C |
| Base 3 | 2120021002 |
| As time | 50492 seconds = 14 h 1 min 32 s |
Is 50492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50492 ÷ 2 = 25246) | 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 (50492 ÷ 4 = 12623) | 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 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 4) | 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 2) | 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 50492 a prime number?
No. 50492 = × 13 × 971, so it is divisible by 2.
What are the factors of 50492?
1, 2, 4, 13, 26, 52, 971, 1942, 3884, 12623, 25246, 50492.
What is 50492 in binary?
1100010100111100 (hexadecimal C53C, octal 142474).
What is the square root of 50492?
About 224.7043, exactly 2√12623.
Is 50492 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50492?
It is a composite number with 12 divisors.