The number 29482
29482 is a composite number with 4 divisors. Its prime factorisation is 2 × 14741. Divisors (4): 1, 2, 14741, 29482.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29482: a semiprime: 2 × 14741, the product of two primes.
- 2
29482 is composite. Its prime factorisation is
- 3
The divisors add up to 44226; without 29482 itself that is 14744, so 29482 is deficient (14744 is less than 29482). Euler's totient φ(29482) = 14740 numbers up to 29482 share no factor with it.
- 4
The digits of 29482 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29482 = 2 \times 14741 \]
29482 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 44226 |
| Euler totient φ(n) | 14740 |
| Square | 869188324 |
| Cube | 25625410168168 |
| Square root | 171.703232 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 134 |
| Scientific notation | 2.9482 × |
29482 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand four hundred and eighty-two |
| Binary (base 2) | 111001100101010 |
| Octal (base 8) | 71452 |
| Hexadecimal (base 16) | 732A |
| Base 3 | 1111102221 |
| As time | 29482 seconds = 8 h 11 min 22 s |
Is 29482 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29482 ÷ 2 = 14741) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29482 a prime number?
No. 29482 = 2 × 14741, so it is divisible by 2.
What are the factors of 29482?
1, 2, 14741, 29482.
What is 29482 in binary?
111001100101010 (hexadecimal 732A, octal 71452).
What is the square root of 29482?
About 171.7032.
Is 29482 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 29482?
29482 is a semiprime: 2 × 14741, the product of two primes.