The number 29413
29413 is a composite number with 4 divisors. Its prime factorisation is 67 × 439. Divisors (4): 1, 67, 439, 29413.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29413: a semiprime: 67 × 439, the product of two primes.
- 2
29413 is composite. Its prime factorisation is
- 3
The divisors add up to 29920; without 29413 itself that is 507, so 29413 is deficient (507 is less than 29413). Euler's totient φ(29413) = 28908 numbers up to 29413 share no factor with it.
- 4
The digits of 29413 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 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29413 = 67 \times 439 \]
29413 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 29920 |
| Euler totient φ(n) | 28908 |
| Square | 865124569 |
| Cube | 25445908947997 |
| Square root | 171.502187 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9413 × |
29413 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand four hundred and thirteen |
| Binary (base 2) | 111001011100101 |
| Octal (base 8) | 71345 |
| Hexadecimal (base 16) | 72E5 |
| Base 3 | 1111100101 |
| As time | 29413 seconds = 8 h 10 min 13 s |
Is 29413 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 3) | 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 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 29413 a prime number?
No. 29413 = 67 × 439, so it is divisible by 67.
What are the factors of 29413?
1, 67, 439, 29413.
What is 29413 in binary?
111001011100101 (hexadecimal 72E5, octal 71345).
What is the square root of 29413?
About 171.5022.
Is 29413 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 29413?
29413 is a semiprime: 67 × 439, the product of two primes.