The number 41059
41059 is a composite number with 4 divisors. Its prime factorisation is 19 × 2161. Divisors (4): 1, 19, 2161, 41059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41059: a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 2161, the product of two primes.
- 2
41059 is composite. Its prime factorisation is
- 3
The divisors add up to 43240; without 41059 itself that is 2181, so 41059 is deficient (2181 is less than 41059). Euler's totient φ(41059) = 38880 numbers up to 41059 share no factor with it.
- 4
The digits of 41059 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 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41059 = 19 \times 2161 \]
41059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 43240 |
| Euler totient φ(n) | 38880 |
| Square | 1685841481 |
| Cube | 69218965368379 |
| Square root | 202.630205 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.1059 × |
41059 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand and fifty-nine |
| Binary (base 2) | 1010000001100011 |
| Octal (base 8) | 120143 |
| Hexadecimal (base 16) | A063 |
| Base 3 | 2002022201 |
| As time | 41059 seconds = 11 h 24 min 19 s |
Is 41059 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 | No (remainder 4) | 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 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 3) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 41059 a prime number?
No. 41059 = 19 × 2161, so it is divisible by 19.
What are the factors of 41059?
1, 19, 2161, 41059.
What is 41059 in binary?
1010000001100011 (hexadecimal A063, octal 120143).
What is the square root of 41059?
About 202.6302.
Is 41059 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 41059?
41059 is a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 2161, the product of two primes.