The number 29690
29690 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 2969. Divisors (8): 1, 2, 5, 10, 2969, 5938, 14845, 29690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29690 is composite. Its prime factorisation is
- 3
The divisors add up to 53460; without 29690 itself that is 23770, so 29690 is deficient (23770 is less than 29690). Euler's totient φ(29690) = 11872 numbers up to 29690 share no factor with it.
- 4
The digits of 29690 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 240 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29690 = 2 \times 5 \times 2969 \]
29690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 53460 |
| Euler totient φ(n) | 11872 |
| Square | 881496100 |
| Cube | 26171619209000 |
| Square root | 172.307864 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 240 |
| Scientific notation | 2.969 × |
29690 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand six hundred and ninety |
| Binary (base 2) | 111001111111010 |
| Octal (base 8) | 71772 |
| Hexadecimal (base 16) | 73FA |
| Base 3 | 1111201122 |
| As time | 29690 seconds = 8 h 14 min 50 s |
Is 29690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29690 ÷ 2 = 14845) | 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 | Yes (29690 ÷ 5 = 5938) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (29690 ÷ 10 = 2969) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 29690 a prime number?
No. 29690 = 2 × 5 × 2969, so it is divisible by 2.
What are the factors of 29690?
1, 2, 5, 10, 2969, 5938, 14845, 29690.
What is 29690 in binary?
111001111111010 (hexadecimal 73FA, octal 71772).
What is the square root of 29690?
About 172.3079.
Is 29690 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 29690?
It is a composite number with 8 divisors.