The number 50632
50632 is a composite number with 8 divisors. Its prime factorisation is × 6329. Divisors (8): 1, 2, 4, 8, 6329, 12658, 25316, 50632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50632 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50632 is composite. Its prime factorisation is
- 3
The divisors add up to 94950; without 50632 itself that is 44318, so 50632 is deficient (44318 is less than 50632). Euler's totient φ(50632) = 25312 numbers up to 50632 share no factor with it.
- 4
The digits of 50632 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50632 = 2^{3} \times 6329 \]50632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 94950 |
| Euler totient φ(n) | 25312 |
| Square | 2563599424 |
| Cube | 129800166035968 |
| Square root | 225.015555 (= 2√12658) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0632 × |
50632 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and thirty-two |
| Binary (base 2) | 1100010111001000 |
| Octal (base 8) | 142710 |
| Hexadecimal (base 16) | C5C8 |
| Base 3 | 2120110021 |
| As time | 50632 seconds = 14 h 3 min 52 s |
Is 50632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50632 ÷ 2 = 25316) | 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 (50632 ÷ 4 = 12658) | 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 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 | Yes (50632 ÷ 8 = 6329) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 10) | 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 50632 a prime number?
No. 50632 = × 6329, so it is divisible by 2.
What are the factors of 50632?
1, 2, 4, 8, 6329, 12658, 25316, 50632.
What is 50632 in binary?
1100010111001000 (hexadecimal C5C8, octal 142710).
What is the square root of 50632?
About 225.0156, exactly 2√12658.
Is 50632 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50632?
It is a composite number with 8 divisors.