The number 41052
41052 is a composite number with 24 divisors. Its prime factorisation is × 3 × 11 × 311. Divisors (24): 1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 132, 311, 622, 933, 1244 … 41052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41052: a Harshad number: divisible by its digit sum 12.
- 2
41052 is composite. Its prime factorisation is
- 3
The divisors add up to 104832; without 41052 itself that is 63780, so 41052 is abundant (63780 is more than 41052). Euler's totient φ(41052) = 12400 numbers up to 41052 share no factor with it.
- 4
The digits of 41052 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41052 = 2^{2} \times 3 \times 11 \times 311 \]41052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 104832 |
| Euler totient φ(n) | 12400 |
| Square | 1685266704 |
| Cube | 69183568732608 |
| Square root | 202.612931 (= 2√10263) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.1052 × |
41052 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand and fifty-two |
| Binary (base 2) | 1010000001011100 |
| Octal (base 8) | 120134 |
| Hexadecimal (base 16) | A05C |
| Base 3 | 2002022110 |
| As time | 41052 seconds = 11 h 24 min 12 s |
Is 41052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (41052 ÷ 2 = 20526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (41052 ÷ 3 = 13684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (41052 ÷ 4 = 10263) | 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 (41052 ÷ 6 = 6842) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 | Yes (41052 ÷ 11 = 3732) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (41052 ÷ 12 = 3421) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41052 a prime number?
No. 41052 = × 3 × 11 × 311, so it is divisible by 2.
What are the factors of 41052?
1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 132, 311, 622, 933, 1244, 1866, 3421, 3732, 6842, 10263, 13684, 20526, 41052.
What is 41052 in binary?
1010000001011100 (hexadecimal A05C, octal 120134).
What is the square root of 41052?
About 202.6129, exactly 2√10263.
Is 41052 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 41052?
41052 is a Harshad number: divisible by its digit sum 12.