The number 29481
29481 is a composite number with 8 divisors. Its prime factorisation is 3 × 31 × 317. Divisors (8): 1, 3, 31, 93, 317, 951, 9827, 29481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29481 is composite. Its prime factorisation is
- 3
The divisors add up to 40704; without 29481 itself that is 11223, so 29481 is deficient (11223 is less than 29481). Euler's totient φ(29481) = 18960 numbers up to 29481 share no factor with it.
- 4
The digits of 29481 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 103 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29481 = 3 \times 31 \times 317 \]
29481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 40704 |
| Euler totient φ(n) | 18960 |
| Square | 869129361 |
| Cube | 25622802691641 |
| Square root | 171.700320 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 103 |
| Scientific notation | 2.9481 × |
29481 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand four hundred and eighty-one |
| Binary (base 2) | 111001100101001 |
| Octal (base 8) | 71451 |
| Hexadecimal (base 16) | 7329 |
| Base 3 | 1111102220 |
| As time | 29481 seconds = 8 h 11 min 21 s |
Is 29481 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 (29481 ÷ 3 = 9827) | 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 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 | 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 1) | 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 29481 a prime number?
No. 29481 = 3 × 31 × 317, so it is divisible by 3.
What are the factors of 29481?
1, 3, 31, 93, 317, 951, 9827, 29481.
What is 29481 in binary?
111001100101001 (hexadecimal 7329, octal 71451).
What is the square root of 29481?
About 171.7003.
Is 29481 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 29481?
It is a composite number with 8 divisors.