The number 50132
50132 is a composite number with 12 divisors. Its prime factorisation is × 83 × 151. Divisors (12): 1, 2, 4, 83, 151, 166, 302, 332, 604, 12533, 25066, 50132.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50132 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50132 is composite. Its prime factorisation is
- 3
The divisors add up to 89376; without 50132 itself that is 39244, so 50132 is deficient (39244 is less than 50132). Euler's totient φ(50132) = 24600 numbers up to 50132 share no factor with it.
- 4
The digits of 50132 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50132 = 2^{2} \times 83 \times 151 \]50132 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 89376 |
| Euler totient φ(n) | 24600 |
| Square | 2513217424 |
| Cube | 125992615899968 |
| Square root | 223.901764 (= 2√12533) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0132 × |
50132 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and thirty-two |
| Binary (base 2) | 1100001111010100 |
| Octal (base 8) | 141724 |
| Hexadecimal (base 16) | C3D4 |
| Base 3 | 2112202202 |
| As time | 50132 seconds = 13 h 55 min 32 s |
Is 50132 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50132 ÷ 2 = 25066) | 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 (50132 ÷ 4 = 12533) | 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 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 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 5) | 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 50132 a prime number?
No. 50132 = × 83 × 151, so it is divisible by 2.
What are the factors of 50132?
1, 2, 4, 83, 151, 166, 302, 332, 604, 12533, 25066, 50132.
What is 50132 in binary?
1100001111010100 (hexadecimal C3D4, octal 141724).
What is the square root of 50132?
About 223.9018, exactly 2√12533.
Is 50132 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50132?
It is a composite number with 12 divisors.