The number 29051
29051 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 139. Divisors (8): 1, 11, 19, 139, 209, 1529, 2641, 29051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29051 is composite. Its prime factorisation is
- 3
The divisors add up to 33600; without 29051 itself that is 4549, so 29051 is deficient (4549 is less than 29051). Euler's totient φ(29051) = 24840 numbers up to 29051 share no factor with it.
- 4
The digits of 29051 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29051 = 11 \times 19 \times 139 \]
29051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 33600 |
| Euler totient φ(n) | 24840 |
| Square | 843960601 |
| Cube | 24517899419651 |
| Square root | 170.443539 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9051 × |
29051 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand and fifty-one |
| Binary (base 2) | 111000101111011 |
| Octal (base 8) | 70573 |
| Hexadecimal (base 16) | 717B |
| Base 3 | 1110211222 |
| As time | 29051 seconds = 8 h 4 min 11 s |
Is 29051 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 2) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (29051 ÷ 11 = 2641) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29051 a prime number?
No. 29051 = 11 × 19 × 139, so it is divisible by 11.
What are the factors of 29051?
1, 11, 19, 139, 209, 1529, 2641, 29051.
What is 29051 in binary?
111000101111011 (hexadecimal 717B, octal 70573).
What is the square root of 29051?
About 170.4435.
Is 29051 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 29051?
It is a composite number with 8 divisors.