The number 41364
41364 is a composite number with 24 divisors. Its prime factorisation is × × 383. Divisors (24): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 383, 766, 1149, 1532 … 41364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41364: a Harshad number: divisible by its digit sum 18.
- 2
41364 is composite. Its prime factorisation is
- 3
The divisors add up to 107520; without 41364 itself that is 66156, so 41364 is abundant (66156 is more than 41364). Euler's totient φ(41364) = 13752 numbers up to 41364 share no factor with it.
- 4
The digits of 41364 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41364 = 2^{2} \times 3^{3} \times 383 \]41364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 107520 |
| Euler totient φ(n) | 13752 |
| Square | 1710980496 |
| Cube | 70772997236544 |
| Square root | 203.381415 (= 6√1149) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.1364 × |
41364 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand three hundred and sixty-four |
| Binary (base 2) | 1010000110010100 |
| Octal (base 8) | 120624 |
| Hexadecimal (base 16) | A194 |
| Base 3 | 2002202000 |
| As time | 41364 seconds = 11 h 29 min 24 s |
Is 41364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (41364 ÷ 2 = 20682) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (41364 ÷ 3 = 13788) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (41364 ÷ 4 = 10341) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (41364 ÷ 6 = 6894) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (41364 ÷ 9 = 4596) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (41364 ÷ 12 = 3447) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41364 a prime number?
No. 41364 = × × 383, so it is divisible by 2.
What are the factors of 41364?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 383, 766, 1149, 1532, 2298, 3447, 4596, 6894, 10341, 13788, 20682, 41364.
What is 41364 in binary?
1010000110010100 (hexadecimal A194, octal 120624).
What is the square root of 41364?
About 203.3814, exactly 6√1149.
Is 41364 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 41364?
41364 is a Harshad number: divisible by its digit sum 18.