The number 5532
5532 is a composite number with 12 divisors. Its prime factorisation is × 3 × 461. Divisors (12): 1, 2, 3, 4, 6, 12, 461, 922, 1383, 1844, 2766, 5532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5532 is composite. Its prime factorisation is
- 3
The divisors add up to 12936; without 5532 itself that is 7404, so 5532 is abundant (7404 is more than 5532). Euler's totient φ(5532) = 1840 numbers up to 5532 share no factor with it.
- 4
The digits of 5532 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 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5532 = 2^{2} \times 3 \times 461 \]5532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 12936 |
| Euler totient φ(n) | 1840 |
| Square | 30603024 |
| Cube | 169295928768 |
| Square root | 74.377416 (= 2√1383) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 98 |
| Scientific notation | 5.532 × |
5532 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and thirty-two |
| Binary (base 2) | 1010110011100 |
| Octal (base 8) | 12634 |
| Hexadecimal (base 16) | 159C |
| Base 3 | 21120220 |
| As time | 5532 seconds = 1 h 32 min 12 s |
Is 5532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5532 ÷ 2 = 2766) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5532 ÷ 3 = 1844) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5532 ÷ 4 = 1383) | 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 (5532 ÷ 6 = 922) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5532 ÷ 12 = 461) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5532 a prime number?
No. 5532 = × 3 × 461, so it is divisible by 2.
What are the factors of 5532?
1, 2, 3, 4, 6, 12, 461, 922, 1383, 1844, 2766, 5532.
What is 5532 in binary?
1010110011100 (hexadecimal 159C, octal 12634).
What is the square root of 5532?
About 74.3774, exactly 2√1383.
Is 5532 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5532?
It is a composite number with 12 divisors.