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