The number 41501
41501 is a composite number with 4 divisors. Its prime factorisation is 47 × 883. Divisors (4): 1, 47, 883, 41501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41501: a semiprime: 47 × 883, the product of two primes.
- 2
41501 is composite. Its prime factorisation is
- 3
The divisors add up to 42432; without 41501 itself that is 931, so 41501 is deficient (931 is less than 41501). Euler's totient φ(41501) = 40572 numbers up to 41501 share no factor with it.
- 4
The digits of 41501 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41501 = 47 \times 883 \]
41501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42432 |
| Euler totient φ(n) | 40572 |
| Square | 1722333001 |
| Cube | 71478541874501 |
| Square root | 203.717942 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.1501 × |
41501 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and one |
| Binary (base 2) | 1010001000011101 |
| Octal (base 8) | 121035 |
| Hexadecimal (base 16) | A21D |
| Base 3 | 2002221002 |
| As time | 41501 seconds = 11 h 31 min 41 s |
Is 41501 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41501 a prime number?
No. 41501 = 47 × 883, so it is divisible by 47.
What are the factors of 41501?
1, 47, 883, 41501.
What is 41501 in binary?
1010001000011101 (hexadecimal A21D, octal 121035).
What is the square root of 41501?
About 203.7179.
Is 41501 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 41501?
41501 is a semiprime: 47 × 883, the product of two primes.