The number 29122
29122 is a composite number with 4 divisors. Its prime factorisation is 2 × 14561. Divisors (4): 1, 2, 14561, 29122.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29122: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 14561, the product of two primes.
- 2
29122 is composite. Its prime factorisation is
- 3
The divisors add up to 43686; without 29122 itself that is 14564, so 29122 is deficient (14564 is less than 29122). Euler's totient φ(29122) = 14560 numbers up to 29122 share no factor with it.
- 4
The digits of 29122 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29122 = 2 \times 14561 \]
29122 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 43686 |
| Euler totient φ(n) | 14560 |
| Square | 848090884 |
| Cube | 24698102723848 |
| Square root | 170.651692 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9122 × |
29122 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand one hundred and twenty-two |
| Binary (base 2) | 111000111000010 |
| Octal (base 8) | 70702 |
| Hexadecimal (base 16) | 71C2 |
| Base 3 | 1110221121 |
| As time | 29122 seconds = 8 h 5 min 22 s |
Is 29122 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29122 ÷ 2 = 14561) | 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 2) | 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 2) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 29122 a prime number?
No. 29122 = 2 × 14561, so it is divisible by 2.
What are the factors of 29122?
1, 2, 14561, 29122.
What is 29122 in binary?
111000111000010 (hexadecimal 71C2, octal 70702).
What is the square root of 29122?
About 170.6517.
Is 29122 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 29122?
29122 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 14561, the product of two primes.