The number 29561
29561 is a composite number with 8 divisors. Its prime factorisation is 7 × 41 × 103. Divisors (8): 1, 7, 41, 103, 287, 721, 4223, 29561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29561 is composite. Its prime factorisation is
- 3
The divisors add up to 34944; without 29561 itself that is 5383, so 29561 is deficient (5383 is less than 29561). Euler's totient φ(29561) = 24480 numbers up to 29561 share no factor with it.
- 4
The digits of 29561 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 196 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29561 = 7 \times 41 \times 103 \]
29561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 34944 |
| Euler totient φ(n) | 24480 |
| Square | 873852721 |
| Cube | 25831960285481 |
| Square root | 171.933127 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 196 |
| Scientific notation | 2.9561 × |
29561 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand five hundred and sixty-one |
| Binary (base 2) | 111001101111001 |
| Octal (base 8) | 71571 |
| Hexadecimal (base 16) | 7379 |
| Base 3 | 1111112212 |
| As time | 29561 seconds = 8 h 12 min 41 s |
Is 29561 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (29561 ÷ 7 = 4223) | 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 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29561 a prime number?
No. 29561 = 7 × 41 × 103, so it is divisible by 7.
What are the factors of 29561?
1, 7, 41, 103, 287, 721, 4223, 29561.
What is 29561 in binary?
111001101111001 (hexadecimal 7379, octal 71571).
What is the square root of 29561?
About 171.9331.
Is 29561 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 29561?
It is a composite number with 8 divisors.