The number 41291
41291 is a composite number with 4 divisors. Its prime factorisation is 157 × 263. Divisors (4): 1, 157, 263, 41291.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41291: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 157 × 263, the product of two primes.
- 2
41291 is composite. Its prime factorisation is
- 3
The divisors add up to 41712; without 41291 itself that is 421, so 41291 is deficient (421 is less than 41291). Euler's totient φ(41291) = 40872 numbers up to 41291 share no factor with it.
- 4
The digits of 41291 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 150 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41291 = 157 \times 263 \]
41291 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 41712 |
| Euler totient φ(n) | 40872 |
| Square | 1704946681 |
| Cube | 70398953405171 |
| Square root | 203.201870 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 150 |
| Scientific notation | 4.1291 × |
41291 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand two hundred and ninety-one |
| Binary (base 2) | 1010000101001011 |
| Octal (base 8) | 120513 |
| Hexadecimal (base 16) | A14B |
| Base 3 | 2002122022 |
| As time | 41291 seconds = 11 h 28 min 11 s |
Is 41291 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 5) | 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 8) | 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 | No (remainder 8) | 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 41291 a prime number?
No. 41291 = 157 × 263, so it is divisible by 157.
What are the factors of 41291?
1, 157, 263, 41291.
What is 41291 in binary?
1010000101001011 (hexadecimal A14B, octal 120513).
What is the square root of 41291?
About 203.2019.
Is 41291 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 41291?
41291 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 157 × 263, the product of two primes.