The number 29341
29341 is a composite number with 8 divisors. Its prime factorisation is 13 × 37 × 61. Divisors (8): 1, 13, 37, 61, 481, 793, 2257, 29341.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29341 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29341 is composite. Its prime factorisation is
- 3
The divisors add up to 32984; without 29341 itself that is 3643, so 29341 is deficient (3643 is less than 29341). Euler's totient φ(29341) = 25920 numbers up to 29341 share no factor with it.
- 4
The digits of 29341 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29341 = 13 \times 37 \times 61 \]
29341 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 32984 |
| Euler totient φ(n) | 25920 |
| Square | 860894281 |
| Cube | 25259499098821 |
| Square root | 171.292148 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.9341 × |
29341 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand three hundred and forty-one |
| Binary (base 2) | 111001010011101 |
| Octal (base 8) | 71235 |
| Hexadecimal (base 16) | 729D |
| Base 3 | 1111020201 |
| As time | 29341 seconds = 8 h 9 min 1 s |
Is 29341 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29341 a prime number?
No. 29341 = 13 × 37 × 61, so it is divisible by 13.
What are the factors of 29341?
1, 13, 37, 61, 481, 793, 2257, 29341.
What is 29341 in binary?
111001010011101 (hexadecimal 729D, octal 71235).
What is the square root of 29341?
About 171.2921.
Is 29341 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 29341?
It is a composite number with 8 divisors.