The number 29331
29331 is a composite number with 6 divisors. Its prime factorisation is × 3259. Divisors (6): 1, 3, 9, 3259, 9777, 29331.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29331 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29331 is composite. Its prime factorisation is
- 3
The divisors add up to 42380; without 29331 itself that is 13049, so 29331 is deficient (13049 is less than 29331). Euler's totient φ(29331) = 19548 numbers up to 29331 share no factor with it.
- 4
The digits of 29331 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29331 = 3^{2} \times 3259 \]29331 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 42380 |
| Euler totient φ(n) | 19548 |
| Square | 860307561 |
| Cube | 25233681071691 |
| Square root | 171.262956 (= 3√3259) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 72 |
| Scientific notation | 2.9331 × |
29331 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand three hundred and thirty-one |
| Binary (base 2) | 111001010010011 |
| Octal (base 8) | 71223 |
| Hexadecimal (base 16) | 7293 |
| Base 3 | 1111020100 |
| As time | 29331 seconds = 8 h 8 min 51 s |
Is 29331 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 (29331 ÷ 3 = 9777) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (29331 ÷ 9 = 3259) | 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 5) | 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 29331 a prime number?
No. 29331 = × 3259, so it is divisible by 3.
What are the factors of 29331?
1, 3, 9, 3259, 9777, 29331.
What is 29331 in binary?
111001010010011 (hexadecimal 7293, octal 71223).
What is the square root of 29331?
About 171.2630, exactly 3√3259.
Is 29331 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 29331?
It is a composite number with 6 divisors.