The number 41061
41061 is a composite number with 4 divisors. Its prime factorisation is 3 × 13687. Divisors (4): 1, 3, 13687, 41061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41061: a semiprime: 3 × 13687, the product of two primes.
- 2
41061 is composite. Its prime factorisation is
- 3
The divisors add up to 54752; without 41061 itself that is 13691, so 41061 is deficient (13691 is less than 41061). Euler's totient φ(41061) = 27372 numbers up to 41061 share no factor with it.
- 4
The digits of 41061 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 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41061 = 3 \times 13687 \]
41061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54752 |
| Euler totient φ(n) | 27372 |
| Square | 1686005721 |
| Cube | 69229080909981 |
| Square root | 202.635140 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.1061 × |
41061 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand and sixty-one |
| Binary (base 2) | 1010000001100101 |
| Octal (base 8) | 120145 |
| Hexadecimal (base 16) | A065 |
| Base 3 | 2002022210 |
| As time | 41061 seconds = 11 h 24 min 21 s |
Is 41061 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (41061 ÷ 3 = 13687) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 | No (remainder 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41061 a prime number?
No. 41061 = 3 × 13687, so it is divisible by 3.
What are the factors of 41061?
1, 3, 13687, 41061.
What is 41061 in binary?
1010000001100101 (hexadecimal A065, octal 120145).
What is the square root of 41061?
About 202.6351.
Is 41061 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 41061?
41061 is a semiprime: 3 × 13687, the product of two primes.