The number 41591
41591 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 199. Divisors (8): 1, 11, 19, 199, 209, 2189, 3781, 41591.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
41591 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
41591 is composite. Its prime factorisation is
- 3
The divisors add up to 48000; without 41591 itself that is 6409, so 41591 is deficient (6409 is less than 41591). Euler's totient φ(41591) = 35640 numbers up to 41591 share no factor with it.
- 4
The digits of 41591 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 150 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41591 = 11 \times 19 \times 199 \]
41591 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 48000 |
| Euler totient φ(n) | 35640 |
| Square | 1729811281 |
| Cube | 71944580988071 |
| Square root | 203.938716 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 150 |
| Scientific notation | 4.1591 × |
41591 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and ninety-one |
| Binary (base 2) | 1010001001110111 |
| Octal (base 8) | 121167 |
| Hexadecimal (base 16) | A277 |
| Base 3 | 2010001102 |
| As time | 41591 seconds = 11 h 33 min 11 s |
Is 41591 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | Yes (41591 ÷ 11 = 3781) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41591 a prime number?
No. 41591 = 11 × 19 × 199, so it is divisible by 11.
What are the factors of 41591?
1, 11, 19, 199, 209, 2189, 3781, 41591.
What is 41591 in binary?
1010001001110111 (hexadecimal A277, octal 121167).
What is the square root of 41591?
About 203.9387.
Is 41591 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 41591?
It is a composite number with 8 divisors.