The number 41505
41505 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 2767. Divisors (8): 1, 3, 5, 15, 2767, 8301, 13835, 41505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41505: a Harshad number: divisible by its digit sum 15.
- 2
41505 is composite. Its prime factorisation is
- 3
The divisors add up to 66432; without 41505 itself that is 24927, so 41505 is deficient (24927 is less than 41505). Euler's totient φ(41505) = 22128 numbers up to 41505 share no factor with it.
- 4
The digits of 41505 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41505 = 3 \times 5 \times 2767 \]
41505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66432 |
| Euler totient φ(n) | 22128 |
| Square | 1722665025 |
| Cube | 71499211862625 |
| Square root | 203.727760 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.1505 × |
41505 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and five |
| Binary (base 2) | 1010001000100001 |
| Octal (base 8) | 121041 |
| Hexadecimal (base 16) | A221 |
| Base 3 | 2002221020 |
| As time | 41505 seconds = 11 h 31 min 45 s |
Is 41505 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 | Yes (41505 ÷ 3 = 13835) | 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 | Yes (41505 ÷ 5 = 8301) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41505 a prime number?
No. 41505 = 3 × 5 × 2767, so it is divisible by 3.
What are the factors of 41505?
1, 3, 5, 15, 2767, 8301, 13835, 41505.
What is 41505 in binary?
1010001000100001 (hexadecimal A221, octal 121041).
What is the square root of 41505?
About 203.7278.
Is 41505 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 41505?
41505 is a Harshad number: divisible by its digit sum 15.