The number 41671
41671 is a composite number with 4 divisors. Its prime factorisation is 7 × 5953. Divisors (4): 1, 7, 5953, 41671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41671: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 5953, the product of two primes.
- 2
41671 is composite. Its prime factorisation is
- 3
The divisors add up to 47632; without 41671 itself that is 5961, so 41671 is deficient (5961 is less than 41671). Euler's totient φ(41671) = 35712 numbers up to 41671 share no factor with it.
- 4
The digits of 41671 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
\[ 41671 = 7 \times 5953 \]
41671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47632 |
| Euler totient φ(n) | 35712 |
| Square | 1736472241 |
| Cube | 72360534754711 |
| Square root | 204.134759 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.1671 × |
41671 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand six hundred and seventy-one |
| Binary (base 2) | 1010001011000111 |
| Octal (base 8) | 121307 |
| Hexadecimal (base 16) | A2C7 |
| Base 3 | 2010011101 |
| As time | 41671 seconds = 11 h 34 min 31 s |
Is 41671 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 1) | 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 | Yes (41671 ÷ 7 = 5953) | 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 1) | 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 3) | 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 41671 a prime number?
No. 41671 = 7 × 5953, so it is divisible by 7.
What are the factors of 41671?
1, 7, 5953, 41671.
What is 41671 in binary?
1010001011000111 (hexadecimal A2C7, octal 121307).
What is the square root of 41671?
About 204.1348.
Is 41671 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 41671?
41671 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 5953, the product of two primes.