The number 41313
41313 is a composite number with 8 divisors. Its prime factorisation is 3 × 47 × 293. Divisors (8): 1, 3, 47, 141, 293, 879, 13771, 41313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
41313 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
41313 is composite. Its prime factorisation is
- 3
The divisors add up to 56448; without 41313 itself that is 15135, so 41313 is deficient (15135 is less than 41313). Euler's totient φ(41313) = 26864 numbers up to 41313 share no factor with it.
- 4
The digits of 41313 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 181 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41313 = 3 \times 47 \times 293 \]
41313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56448 |
| Euler totient φ(n) | 26864 |
| Square | 1706763969 |
| Cube | 70511539851297 |
| Square root | 203.255996 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 181 |
| Scientific notation | 4.1313 × |
41313 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand three hundred and thirteen |
| Binary (base 2) | 1010000101100001 |
| Octal (base 8) | 120541 |
| Hexadecimal (base 16) | A161 |
| Base 3 | 2002200010 |
| As time | 41313 seconds = 11 h 28 min 33 s |
Is 41313 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 (41313 ÷ 3 = 13771) | 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 3) | 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 6) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 41313 a prime number?
No. 41313 = 3 × 47 × 293, so it is divisible by 3.
What are the factors of 41313?
1, 3, 47, 141, 293, 879, 13771, 41313.
What is 41313 in binary?
1010000101100001 (hexadecimal A161, octal 120541).
What is the square root of 41313?
About 203.2560.
Is 41313 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 41313?
It is a composite number with 8 divisors.