The number 29606
29606 is a composite number with 8 divisors. Its prime factorisation is 2 × 113 × 131. Divisors (8): 1, 2, 113, 131, 226, 262, 14803, 29606.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29606 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29606 is composite. Its prime factorisation is
- 3
The divisors add up to 45144; without 29606 itself that is 15538, so 29606 is deficient (15538 is less than 29606). Euler's totient φ(29606) = 14560 numbers up to 29606 share no factor with it.
- 4
The digits of 29606 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 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29606 = 2 \times 113 \times 131 \]
29606 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 45144 |
| Euler totient φ(n) | 14560 |
| Square | 876515236 |
| Cube | 25950110077016 |
| Square root | 172.063942 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 72 |
| Scientific notation | 2.9606 × |
29606 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand six hundred and six |
| Binary (base 2) | 111001110100110 |
| Octal (base 8) | 71646 |
| Hexadecimal (base 16) | 73A6 |
| Base 3 | 1111121112 |
| As time | 29606 seconds = 8 h 13 min 26 s |
Is 29606 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29606 ÷ 2 = 14803) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29606 a prime number?
No. 29606 = 2 × 113 × 131, so it is divisible by 2.
What are the factors of 29606?
1, 2, 113, 131, 226, 262, 14803, 29606.
What is 29606 in binary?
111001110100110 (hexadecimal 73A6, octal 71646).
What is the square root of 29606?
About 172.0639.
Is 29606 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 29606?
It is a composite number with 8 divisors.