The number 29121
29121 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 571. Divisors (8): 1, 3, 17, 51, 571, 1713, 9707, 29121.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29121: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
29121 is composite. Its prime factorisation is
- 3
The divisors add up to 41184; without 29121 itself that is 12063, so 29121 is deficient (12063 is less than 29121). Euler's totient φ(29121) = 18240 numbers up to 29121 share no factor with it.
- 4
The digits of 29121 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29121 = 3 \times 17 \times 571 \]
29121 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 41184 |
| Euler totient φ(n) | 18240 |
| Square | 848032641 |
| Cube | 24695558538561 |
| Square root | 170.648762 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9121 × |
29121 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand one hundred and twenty-one |
| Binary (base 2) | 111000111000001 |
| Octal (base 8) | 70701 |
| Hexadecimal (base 16) | 71C1 |
| Base 3 | 1110221120 |
| As time | 29121 seconds = 8 h 5 min 21 s |
Is 29121 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 (29121 ÷ 3 = 9707) | 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 | No (remainder 1) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 | No (remainder 4) | 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 29121 a prime number?
No. 29121 = 3 × 17 × 571, so it is divisible by 3.
What are the factors of 29121?
1, 3, 17, 51, 571, 1713, 9707, 29121.
What is 29121 in binary?
111000111000001 (hexadecimal 71C1, octal 70701).
What is the square root of 29121?
About 170.6488.
Is 29121 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 29121?
29121 is a happy number: repeatedly adding the squares of its digits reaches 1.