The number 29391
29391 is a composite number with 8 divisors. Its prime factorisation is 3 × 97 × 101. Divisors (8): 1, 3, 97, 101, 291, 303, 9797, 29391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29391: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
29391 is composite. Its prime factorisation is
- 3
The divisors add up to 39984; without 29391 itself that is 10593, so 29391 is deficient (10593 is less than 29391). Euler's totient φ(29391) = 19200 numbers up to 29391 share no factor with it.
- 4
The digits of 29391 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 271 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29391 = 3 \times 97 \times 101 \]
29391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 39984 |
| Euler totient φ(n) | 19200 |
| Square | 863830881 |
| Cube | 25388853423471 |
| Square root | 171.438035 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 271 |
| Scientific notation | 2.9391 × |
29391 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand three hundred and ninety-one |
| Binary (base 2) | 111001011001111 |
| Octal (base 8) | 71317 |
| Hexadecimal (base 16) | 72CF |
| Base 3 | 1111022120 |
| As time | 29391 seconds = 8 h 9 min 51 s |
Is 29391 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 (29391 ÷ 3 = 9797) | 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 5) | 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 7) | 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 10) | 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 29391 a prime number?
No. 29391 = 3 × 97 × 101, so it is divisible by 3.
What are the factors of 29391?
1, 3, 97, 101, 291, 303, 9797, 29391.
What is 29391 in binary?
111001011001111 (hexadecimal 72CF, octal 71317).
What is the square root of 29391?
About 171.4380.
Is 29391 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 29391?
29391 is a happy number: repeatedly adding the squares of its digits reaches 1.