The number 41695
41695 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 269. Divisors (8): 1, 5, 31, 155, 269, 1345, 8339, 41695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
41695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
41695 is composite. Its prime factorisation is
- 3
The divisors add up to 51840; without 41695 itself that is 10145, so 41695 is deficient (10145 is less than 41695). Euler's totient φ(41695) = 32160 numbers up to 41695 share no factor with it.
- 4
The digits of 41695 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41695 = 5 \times 31 \times 269 \]
41695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 51840 |
| Euler totient φ(n) | 32160 |
| Square | 1738473025 |
| Cube | 72485632777375 |
| Square root | 204.193536 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.1695 × |
41695 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand six hundred and ninety-five |
| Binary (base 2) | 1010001011011111 |
| Octal (base 8) | 121337 |
| Hexadecimal (base 16) | A2DF |
| Base 3 | 2010012021 |
| As time | 41695 seconds = 11 h 34 min 55 s |
Is 41695 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 1) | 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 (41695 ÷ 5 = 8339) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41695 a prime number?
No. 41695 = 5 × 31 × 269, so it is divisible by 5.
What are the factors of 41695?
1, 5, 31, 155, 269, 1345, 8339, 41695.
What is 41695 in binary?
1010001011011111 (hexadecimal A2DF, octal 121337).
What is the square root of 41695?
About 204.1935.
Is 41695 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 41695?
It is a composite number with 8 divisors.