The number 29055
29055 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 13 × 149. Divisors (16): 1, 3, 5, 13, 15, 39, 65, 149, 195, 447, 745, 1937, 2235, 5811, 9685, 29055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29055 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29055 is composite. Its prime factorisation is
- 3
The divisors add up to 50400; without 29055 itself that is 21345, so 29055 is deficient (21345 is less than 29055). Euler's totient φ(29055) = 14208 numbers up to 29055 share no factor with it.
- 4
The digits of 29055 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 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29055 = 3 \times 5 \times 13 \times 149 \]
29055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 50400 |
| Euler totient φ(n) | 14208 |
| Square | 844193025 |
| Cube | 24528028341375 |
| Square root | 170.455273 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 72 |
| Scientific notation | 2.9055 × |
29055 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand and fifty-five |
| Binary (base 2) | 111000101111111 |
| Octal (base 8) | 70577 |
| Hexadecimal (base 16) | 717F |
| Base 3 | 1110212010 |
| As time | 29055 seconds = 8 h 4 min 15 s |
Is 29055 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 (29055 ÷ 3 = 9685) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (29055 ÷ 5 = 5811) | 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 | 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 7) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29055 a prime number?
No. 29055 = 3 × 5 × 13 × 149, so it is divisible by 3.
What are the factors of 29055?
1, 3, 5, 13, 15, 39, 65, 149, 195, 447, 745, 1937, 2235, 5811, 9685, 29055.
What is 29055 in binary?
111000101111111 (hexadecimal 717F, octal 70577).
What is the square root of 29055?
About 170.4553.
Is 29055 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 29055?
It is a composite number with 16 divisors.