The number 41301
41301 is a composite number with 12 divisors. Its prime factorisation is × 13 × 353. Divisors (12): 1, 3, 9, 13, 39, 117, 353, 1059, 3177, 4589, 13767, 41301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41301: a Harshad number: divisible by its digit sum 9.
- 2
41301 is composite. Its prime factorisation is
- 3
The divisors add up to 64428; without 41301 itself that is 23127, so 41301 is deficient (23127 is less than 41301). Euler's totient φ(41301) = 25344 numbers up to 41301 share no factor with it.
- 4
The digits of 41301 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41301 = 3^{2} \times 13 \times 353 \]41301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 64428 |
| Euler totient φ(n) | 25344 |
| Square | 1705772601 |
| Cube | 70450114193901 |
| Square root | 203.226475 (= 3√4589) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 106 |
| Scientific notation | 4.1301 × |
41301 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand three hundred and one |
| Binary (base 2) | 1010000101010101 |
| Octal (base 8) | 120525 |
| Hexadecimal (base 16) | A155 |
| Base 3 | 2002122200 |
| As time | 41301 seconds = 11 h 28 min 21 s |
Is 41301 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 (41301 ÷ 3 = 13767) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (41301 ÷ 9 = 4589) | 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 7) | 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 41301 a prime number?
No. 41301 = × 13 × 353, so it is divisible by 3.
What are the factors of 41301?
1, 3, 9, 13, 39, 117, 353, 1059, 3177, 4589, 13767, 41301.
What is 41301 in binary?
1010000101010101 (hexadecimal A155, octal 120525).
What is the square root of 41301?
About 203.2265, exactly 3√4589.
Is 41301 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 41301?
41301 is a Harshad number: divisible by its digit sum 9.