The number 532
532 is a composite number with 12 divisors. Its prime factorisation is × 7 × 19. Divisors (12): 1, 2, 4, 7, 14, 19, 28, 38, 76, 133, 266, 532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
532 is composite. Its prime factorisation is
- 3
The divisors add up to 1120; without 532 itself that is 588, so 532 is abundant (588 is more than 532). Euler's totient φ(532) = 216 numbers up to 532 share no factor with it.
- 4
The digits of 532 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 30 steps to reach 1.
LaTeX source of the formulas on this page
\[ 532 = 2^{2} \times 7 \times 19 \]532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 1120 |
| Euler totient φ(n) | 216 |
| Square | 283024 |
| Cube | 150568768 |
| Square root | 23.065125 (= 2√133) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 30 |
| Scientific notation | 5.32 × |
532 in other forms
| Form | Value |
|---|---|
| In words | five hundred and thirty-two |
| Roman numerals | DXXXII |
| Binary (base 2) | 1000010100 |
| Octal (base 8) | 1024 |
| Hexadecimal (base 16) | 214 |
| Base 3 | 201201 |
| As time | 532 seconds = 8 min 52 s |
Is 532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (532 ÷ 2 = 266) | 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 (532 ÷ 4 = 133) | 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 | Yes (532 ÷ 7 = 76) | 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 1) | 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 532 a prime number?
No. 532 = × 7 × 19, so it is divisible by 2.
What are the factors of 532?
1, 2, 4, 7, 14, 19, 28, 38, 76, 133, 266, 532.
What is 532 in binary?
1000010100 (hexadecimal 214, octal 1024).
What is the square root of 532?
About 23.0651, exactly 2√133.
What is 532 in Roman numerals?
DXXXII.
Is 532 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 532?
It is a composite number with 12 divisors.