The number 40341
40341 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 17 × 113. Divisors (16): 1, 3, 7, 17, 21, 51, 113, 119, 339, 357, 791, 1921, 2373, 5763, 13447, 40341.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40341 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40341 is composite. Its prime factorisation is
- 3
The divisors add up to 65664; without 40341 itself that is 25323, so 40341 is deficient (25323 is less than 40341). Euler's totient φ(40341) = 21504 numbers up to 40341 share no factor with it.
- 4
The digits of 40341 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40341 = 3 \times 7 \times 17 \times 113 \]
40341 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 65664 |
| Euler totient φ(n) | 21504 |
| Square | 1627396281 |
| Cube | 65650793371821 |
| Square root | 200.850691 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.0341 × |
40341 in other forms
| Form | Value |
|---|---|
| In words | forty thousand three hundred and forty-one |
| Binary (base 2) | 1001110110010101 |
| Octal (base 8) | 116625 |
| Hexadecimal (base 16) | 9D95 |
| Base 3 | 2001100010 |
| As time | 40341 seconds = 11 h 12 min 21 s |
Is 40341 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 (40341 ÷ 3 = 13447) | 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 | Yes (40341 ÷ 7 = 5763) | 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 3) | 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 4) | 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 40341 a prime number?
No. 40341 = 3 × 7 × 17 × 113, so it is divisible by 3.
What are the factors of 40341?
1, 3, 7, 17, 21, 51, 113, 119, 339, 357, 791, 1921, 2373, 5763, 13447, 40341.
What is 40341 in binary?
1001110110010101 (hexadecimal 9D95, octal 116625).
What is the square root of 40341?
About 200.8507.
Is 40341 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 40341?
It is a composite number with 16 divisors.