The number 29505
29505 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 281. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 105, 281, 843, 1405, 1967, 4215, 5901, 9835, 29505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29505: a Harshad number: divisible by its digit sum 21.
- 2
29505 is composite. Its prime factorisation is
- 3
The divisors add up to 54144; without 29505 itself that is 24639, so 29505 is deficient (24639 is less than 29505). Euler's totient φ(29505) = 13440 numbers up to 29505 share no factor with it.
- 4
The digits of 29505 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29505 = 3 \times 5 \times 7 \times 281 \]
29505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 54144 |
| Euler totient φ(n) | 13440 |
| Square | 870545025 |
| Cube | 25685430962625 |
| Square root | 171.770195 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 134 |
| Scientific notation | 2.9505 × |
29505 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand five hundred and five |
| Binary (base 2) | 111001101000001 |
| Octal (base 8) | 71501 |
| Hexadecimal (base 16) | 7341 |
| Base 3 | 1111110210 |
| As time | 29505 seconds = 8 h 11 min 45 s |
Is 29505 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 | Yes (29505 ÷ 3 = 9835) | 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 | Yes (29505 ÷ 5 = 5901) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (29505 ÷ 7 = 4215) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29505 a prime number?
No. 29505 = 3 × 5 × 7 × 281, so it is divisible by 3.
What are the factors of 29505?
1, 3, 5, 7, 15, 21, 35, 105, 281, 843, 1405, 1967, 4215, 5901, 9835, 29505.
What is 29505 in binary?
111001101000001 (hexadecimal 7341, octal 71501).
What is the square root of 29505?
About 171.7702.
Is 29505 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 29505?
29505 is a Harshad number: divisible by its digit sum 21.