The number 29468
29468 is a composite number with 12 divisors. Its prime factorisation is × 53 × 139. Divisors (12): 1, 2, 4, 53, 106, 139, 212, 278, 556, 7367, 14734, 29468.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
29468 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
29468 is composite. Its prime factorisation is
- 3
The divisors add up to 52920; without 29468 itself that is 23452, so 29468 is deficient (23452 is less than 29468). Euler's totient φ(29468) = 14352 numbers up to 29468 share no factor with it.
- 4
The digits of 29468 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 121 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29468 = 2^{2} \times 53 \times 139 \]29468 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 52920 |
| Euler totient φ(n) | 14352 |
| Square | 868363024 |
| Cube | 25588921591232 |
| Square root | 171.662459 (= 2√7367) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 121 |
| Scientific notation | 2.9468 × |
29468 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand four hundred and sixty-eight |
| Binary (base 2) | 111001100011100 |
| Octal (base 8) | 71434 |
| Hexadecimal (base 16) | 731C |
| Base 3 | 1111102102 |
| As time | 29468 seconds = 8 h 11 min 8 s |
Is 29468 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29468 ÷ 2 = 14734) | 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 | Yes (29468 ÷ 4 = 7367) | 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 2) | 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 4) | 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 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29468 a prime number?
No. 29468 = × 53 × 139, so it is divisible by 2.
What are the factors of 29468?
1, 2, 4, 53, 106, 139, 212, 278, 556, 7367, 14734, 29468.
What is 29468 in binary?
111001100011100 (hexadecimal 731C, octal 71434).
What is the square root of 29468?
About 171.6625, exactly 2√7367.
Is 29468 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 29468?
It is a composite number with 12 divisors.