The number 41152
41152 is a composite number with 14 divisors. Its prime factorisation is × 643. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 643, 1286, 2572, 5144, 10288, 20576, 41152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
41152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
41152 is composite. Its prime factorisation is
- 3
The divisors add up to 81788; without 41152 itself that is 40636, so 41152 is deficient (40636 is less than 41152). Euler's totient φ(41152) = 20544 numbers up to 41152 share no factor with it.
- 4
The digits of 41152 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41152 = 2^{6} \times 643 \]41152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 81788 |
| Euler totient φ(n) | 20544 |
| Square | 1693487104 |
| Cube | 69690381303808 |
| Square root | 202.859557 (= 8√643) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 31 |
| Scientific notation | 4.1152 × |
41152 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand one hundred and fifty-two |
| Binary (base 2) | 1010000011000000 |
| Octal (base 8) | 120300 |
| Hexadecimal (base 16) | A0C0 |
| Base 3 | 2002110011 |
| As time | 41152 seconds = 11 h 25 min 52 s |
Is 41152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (41152 ÷ 2 = 20576) | 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 (41152 ÷ 4 = 10288) | 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 6) | 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 | Yes (41152 ÷ 8 = 5144) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 1) | 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 41152 a prime number?
No. 41152 = × 643, so it is divisible by 2.
What are the factors of 41152?
1, 2, 4, 8, 16, 32, 64, 643, 1286, 2572, 5144, 10288, 20576, 41152.
What is 41152 in binary?
1010000011000000 (hexadecimal A0C0, octal 120300).
What is the square root of 41152?
About 202.8596, exactly 8√643.
Is 41152 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 41152?
It is a composite number with 14 divisors.