The number 51532
51532 is a composite number with 12 divisors. Its prime factorisation is × 13 × 991. Divisors (12): 1, 2, 4, 13, 26, 52, 991, 1982, 3964, 12883, 25766, 51532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51532 is composite. Its prime factorisation is
- 3
The divisors add up to 97216; without 51532 itself that is 45684, so 51532 is deficient (45684 is less than 51532). Euler's totient φ(51532) = 23760 numbers up to 51532 share no factor with it.
- 4
The digits of 51532 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51532 = 2^{2} \times 13 \times 991 \]51532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 97216 |
| Euler totient φ(n) | 23760 |
| Square | 2655547024 |
| Cube | 136845649240768 |
| Square root | 227.006608 (= 2√12883) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1532 × |
51532 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and thirty-two |
| Binary (base 2) | 1100100101001100 |
| Octal (base 8) | 144514 |
| Hexadecimal (base 16) | C94C |
| Base 3 | 2121200121 |
| As time | 51532 seconds = 14 h 18 min 52 s |
Is 51532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51532 ÷ 2 = 25766) | 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 (51532 ÷ 4 = 12883) | 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 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 8) | 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 51532 a prime number?
No. 51532 = × 13 × 991, so it is divisible by 2.
What are the factors of 51532?
1, 2, 4, 13, 26, 52, 991, 1982, 3964, 12883, 25766, 51532.
What is 51532 in binary?
1100100101001100 (hexadecimal C94C, octal 144514).
What is the square root of 51532?
About 227.0066, exactly 2√12883.
Is 51532 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51532?
It is a composite number with 12 divisors.