The number 50532
50532 is a composite number with 12 divisors. Its prime factorisation is × 3 × 4211. Divisors (12): 1, 2, 3, 4, 6, 12, 4211, 8422, 12633, 16844, 25266, 50532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50532 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 50532 itself that is 67404, so 50532 is abundant (67404 is more than 50532). Euler's totient φ(50532) = 16840 numbers up to 50532 share no factor with it.
- 4
The digits of 50532 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50532 = 2^{2} \times 3 \times 4211 \]50532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 16840 |
| Square | 2553483024 |
| Cube | 129032604168768 |
| Square root | 224.793238 (= 2√12633) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0532 × |
50532 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and thirty-two |
| Binary (base 2) | 1100010101100100 |
| Octal (base 8) | 142544 |
| Hexadecimal (base 16) | C564 |
| Base 3 | 2120022120 |
| As time | 50532 seconds = 14 h 2 min 12 s |
Is 50532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50532 ÷ 2 = 25266) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50532 ÷ 3 = 16844) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50532 ÷ 4 = 12633) | 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 | Yes (50532 ÷ 6 = 8422) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50532 ÷ 12 = 4211) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50532 a prime number?
No. 50532 = × 3 × 4211, so it is divisible by 2.
What are the factors of 50532?
1, 2, 3, 4, 6, 12, 4211, 8422, 12633, 16844, 25266, 50532.
What is 50532 in binary?
1100010101100100 (hexadecimal C564, octal 142544).
What is the square root of 50532?
About 224.7932, exactly 2√12633.
Is 50532 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50532?
It is a composite number with 12 divisors.