The number 29141
29141 is a composite number with 8 divisors. Its prime factorisation is 7 × 23 × 181. Divisors (8): 1, 7, 23, 161, 181, 1267, 4163, 29141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29141: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
29141 is composite. Its prime factorisation is
- 3
The divisors add up to 34944; without 29141 itself that is 5803, so 29141 is deficient (5803 is less than 29141). Euler's totient φ(29141) = 23760 numbers up to 29141 share no factor with it.
- 4
The digits of 29141 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 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29141 = 7 \times 23 \times 181 \]
29141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 34944 |
| Euler totient φ(n) | 23760 |
| Square | 849197881 |
| Cube | 24746475450221 |
| Square root | 170.707352 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.9141 × |
29141 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand one hundred and forty-one |
| Binary (base 2) | 111000111010101 |
| Octal (base 8) | 70725 |
| Hexadecimal (base 16) | 71D5 |
| Base 3 | 1110222022 |
| As time | 29141 seconds = 8 h 5 min 41 s |
Is 29141 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (29141 ÷ 7 = 4163) | 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 5) | 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 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29141 a prime number?
No. 29141 = 7 × 23 × 181, so it is divisible by 7.
What are the factors of 29141?
1, 7, 23, 161, 181, 1267, 4163, 29141.
What is 29141 in binary?
111000111010101 (hexadecimal 71D5, octal 70725).
What is the square root of 29141?
About 170.7074.
Is 29141 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 29141?
29141 is a happy number: repeatedly adding the squares of its digits reaches 1.