The number 50692
50692 is a composite number with 24 divisors. Its prime factorisation is × 19 × 23 × 29. Divisors (24): 1, 2, 4, 19, 23, 29, 38, 46, 58, 76, 92, 116, 437, 551, 667, 874 … 50692.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50692 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50692 is composite. Its prime factorisation is
- 3
The divisors add up to 100800; without 50692 itself that is 50108, so 50692 is deficient (50108 is less than 50692). Euler's totient φ(50692) = 22176 numbers up to 50692 share no factor with it.
- 4
The digits of 50692 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50692 = 2^{2} \times 19 \times 23 \times 29 \]50692 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 100800 |
| Euler totient φ(n) | 22176 |
| Square | 2569678864 |
| Cube | 130262160973888 |
| Square root | 225.148840 (= 2√12673) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0692 × |
50692 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and ninety-two |
| Binary (base 2) | 1100011000000100 |
| Octal (base 8) | 143004 |
| Hexadecimal (base 16) | C604 |
| Base 3 | 2120112111 |
| As time | 50692 seconds = 14 h 4 min 52 s |
Is 50692 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50692 ÷ 2 = 25346) | 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 | Yes (50692 ÷ 4 = 12673) | 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 4) | 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 4) | 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 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50692 a prime number?
No. 50692 = × 19 × 23 × 29, so it is divisible by 2.
What are the factors of 50692?
1, 2, 4, 19, 23, 29, 38, 46, 58, 76, 92, 116, 437, 551, 667, 874, 1102, 1334, 1748, 2204, 2668, 12673, 25346, 50692.
What is 50692 in binary?
1100011000000100 (hexadecimal C604, octal 143004).
What is the square root of 50692?
About 225.1488, exactly 2√12673.
Is 50692 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50692?
It is a composite number with 24 divisors.