The number 29315
29315 is a composite number with 16 divisors. Its prime factorisation is 5 × 11 × 13 × 41. Divisors (16): 1, 5, 11, 13, 41, 55, 65, 143, 205, 451, 533, 715, 2255, 2665, 5863, 29315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29315 is composite. Its prime factorisation is
- 3
The divisors add up to 42336; without 29315 itself that is 13021, so 29315 is deficient (13021 is less than 29315). Euler's totient φ(29315) = 19200 numbers up to 29315 share no factor with it.
- 4
The digits of 29315 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29315 = 5 \times 11 \times 13 \times 41 \]
29315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 42336 |
| Euler totient φ(n) | 19200 |
| Square | 859369225 |
| Cube | 25192408830875 |
| Square root | 171.216238 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 134 |
| Scientific notation | 2.9315 × |
29315 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand three hundred and fifteen |
| Binary (base 2) | 111001010000011 |
| Octal (base 8) | 71203 |
| Hexadecimal (base 16) | 7283 |
| Base 3 | 1111012202 |
| As time | 29315 seconds = 8 h 8 min 35 s |
Is 29315 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (29315 ÷ 5 = 5863) | 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 | No (remainder 6) | 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 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (29315 ÷ 11 = 2665) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29315 a prime number?
No. 29315 = 5 × 11 × 13 × 41, so it is divisible by 5.
What are the factors of 29315?
1, 5, 11, 13, 41, 55, 65, 143, 205, 451, 533, 715, 2255, 2665, 5863, 29315.
What is 29315 in binary?
111001010000011 (hexadecimal 7283, octal 71203).
What is the square root of 29315?
About 171.2162.
Is 29315 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 29315?
It is a composite number with 16 divisors.