The number 29506
29506 is a composite number with 4 divisors. Its prime factorisation is 2 × 14753. Divisors (4): 1, 2, 14753, 29506.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29506: a semiprime: 2 × 14753, the product of two primes.
- 2
29506 is composite. Its prime factorisation is
- 3
The divisors add up to 44262; without 29506 itself that is 14756, so 29506 is deficient (14756 is less than 29506). Euler's totient φ(29506) = 14752 numbers up to 29506 share no factor with it.
- 4
The digits of 29506 add up to 22, 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
\[ 29506 = 2 \times 14753 \]
29506 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 44262 |
| Euler totient φ(n) | 14752 |
| Square | 870604036 |
| Cube | 25688042686216 |
| Square root | 171.773106 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9506 × |
29506 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand five hundred and six |
| Binary (base 2) | 111001101000010 |
| Octal (base 8) | 71502 |
| Hexadecimal (base 16) | 7342 |
| Base 3 | 1111110211 |
| As time | 29506 seconds = 8 h 11 min 46 s |
Is 29506 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29506 ÷ 2 = 14753) | 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 1) | 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 1) | 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 4) | 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 4) | 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 29506 a prime number?
No. 29506 = 2 × 14753, so it is divisible by 2.
What are the factors of 29506?
1, 2, 14753, 29506.
What is 29506 in binary?
111001101000010 (hexadecimal 7342, octal 71502).
What is the square root of 29506?
About 171.7731.
Is 29506 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 29506?
29506 is a semiprime: 2 × 14753, the product of two primes.