The number 29497
29497 is a composite number with 4 divisors. Its prime factorisation is 13 × 2269. Divisors (4): 1, 13, 2269, 29497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29497: a semiprime: 13 × 2269, the product of two primes.
- 2
29497 is composite. Its prime factorisation is
- 3
The divisors add up to 31780; without 29497 itself that is 2283, so 29497 is deficient (2283 is less than 29497). Euler's totient φ(29497) = 27216 numbers up to 29497 share no factor with it.
- 4
The digits of 29497 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29497 = 13 \times 2269 \]
29497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 31780 |
| Euler totient φ(n) | 27216 |
| Square | 870073009 |
| Cube | 25664543546473 |
| Square root | 171.746907 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9497 × |
29497 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand four hundred and ninety-seven |
| Binary (base 2) | 111001100111001 |
| Octal (base 8) | 71471 |
| Hexadecimal (base 16) | 7339 |
| Base 3 | 1111110111 |
| As time | 29497 seconds = 8 h 11 min 37 s |
Is 29497 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 2) | 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 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 29497 a prime number?
No. 29497 = 13 × 2269, so it is divisible by 13.
What are the factors of 29497?
1, 13, 2269, 29497.
What is 29497 in binary?
111001100111001 (hexadecimal 7339, octal 71471).
What is the square root of 29497?
About 171.7469.
Is 29497 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 29497?
29497 is a semiprime: 13 × 2269, the product of two primes.