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