The number 29313
29313 is a composite number with 6 divisors. Its prime factorisation is × 3257. Divisors (6): 1, 3, 9, 3257, 9771, 29313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29313 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29313 is composite. Its prime factorisation is
- 3
The divisors add up to 42354; without 29313 itself that is 13041, so 29313 is deficient (13041 is less than 29313). Euler's totient φ(29313) = 19536 numbers up to 29313 share no factor with it.
- 4
The digits of 29313 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 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29313 = 3^{2} \times 3257 \]29313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 42354 |
| Euler totient φ(n) | 19536 |
| Square | 859251969 |
| Cube | 25187252967297 |
| Square root | 171.210397 (= 3√3257) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9313 × |
29313 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand three hundred and thirteen |
| Binary (base 2) | 111001010000001 |
| Octal (base 8) | 71201 |
| Hexadecimal (base 16) | 7281 |
| Base 3 | 1111012200 |
| As time | 29313 seconds = 8 h 8 min 33 s |
Is 29313 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 (29313 ÷ 3 = 9771) | 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 3) | 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 4) | 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 | Yes (29313 ÷ 9 = 3257) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 29313 a prime number?
No. 29313 = × 3257, so it is divisible by 3.
What are the factors of 29313?
1, 3, 9, 3257, 9771, 29313.
What is 29313 in binary?
111001010000001 (hexadecimal 7281, octal 71201).
What is the square root of 29313?
About 171.2104, exactly 3√3257.
Is 29313 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 29313?
It is a composite number with 6 divisors.