The number 41595
41595 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 47 × 59. Divisors (16): 1, 3, 5, 15, 47, 59, 141, 177, 235, 295, 705, 885, 2773, 8319, 13865, 41595.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
41595 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
41595 is composite. Its prime factorisation is
- 3
The divisors add up to 69120; without 41595 itself that is 27525, so 41595 is deficient (27525 is less than 41595). Euler's totient φ(41595) = 21344 numbers up to 41595 share no factor with it.
- 4
The digits of 41595 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 212 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41595 = 3 \times 5 \times 47 \times 59 \]
41595 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 69120 |
| Euler totient φ(n) | 21344 |
| Square | 1730144025 |
| Cube | 71965340719875 |
| Square root | 203.948523 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 212 |
| Scientific notation | 4.1595 × |
41595 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and ninety-five |
| Binary (base 2) | 1010001001111011 |
| Octal (base 8) | 121173 |
| Hexadecimal (base 16) | A27B |
| Base 3 | 2010001120 |
| As time | 41595 seconds = 11 h 33 min 15 s |
Is 41595 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 (41595 ÷ 3 = 13865) | 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 | Yes (41595 ÷ 5 = 8319) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41595 a prime number?
No. 41595 = 3 × 5 × 47 × 59, so it is divisible by 3.
What are the factors of 41595?
1, 3, 5, 15, 47, 59, 141, 177, 235, 295, 705, 885, 2773, 8319, 13865, 41595.
What is 41595 in binary?
1010001001111011 (hexadecimal A27B, octal 121173).
What is the square root of 41595?
About 203.9485.
Is 41595 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 41595?
It is a composite number with 16 divisors.