The number 41540
41540 is a composite number with 24 divisors. Its prime factorisation is × 5 × 31 × 67. Divisors (24): 1, 2, 4, 5, 10, 20, 31, 62, 67, 124, 134, 155, 268, 310, 335, 620 … 41540.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
41540 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
41540 is composite. Its prime factorisation is
- 3
The divisors add up to 91392; without 41540 itself that is 49852, so 41540 is abundant (49852 is more than 41540). Euler's totient φ(41540) = 15840 numbers up to 41540 share no factor with it.
- 4
The digits of 41540 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41540 = 2^{2} \times 5 \times 31 \times 67 \]41540 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 91392 |
| Euler totient φ(n) | 15840 |
| Square | 1725571600 |
| Cube | 71680244264000 |
| Square root | 203.813640 (= 2√10385) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.154 × |
41540 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and forty |
| Binary (base 2) | 1010001001000100 |
| Octal (base 8) | 121104 |
| Hexadecimal (base 16) | A244 |
| Base 3 | 2002222112 |
| As time | 41540 seconds = 11 h 32 min 20 s |
Is 41540 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (41540 ÷ 2 = 20770) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (41540 ÷ 4 = 10385) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (41540 ÷ 5 = 8308) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (41540 ÷ 10 = 4154) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41540 a prime number?
No. 41540 = × 5 × 31 × 67, so it is divisible by 2.
What are the factors of 41540?
1, 2, 4, 5, 10, 20, 31, 62, 67, 124, 134, 155, 268, 310, 335, 620, 670, 1340, 2077, 4154, 8308, 10385, 20770, 41540.
What is 41540 in binary?
1010001001000100 (hexadecimal A244, octal 121104).
What is the square root of 41540?
About 203.8136, exactly 2√10385.
Is 41540 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 41540?
It is a composite number with 24 divisors.