The number 29223
29223 is a binary palindrome (111001000100111). Its prime factorisation is × 17 × 191. Divisors (12): 1, 3, 9, 17, 51, 153, 191, 573, 1719, 3247, 9741, 29223.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29223: a binary palindrome (111001000100111).
- 2
29223 is composite. Its prime factorisation is
- 3
The divisors add up to 44928; without 29223 itself that is 15705, so 29223 is deficient (15705 is less than 29223). Euler's totient φ(29223) = 18240 numbers up to 29223 share no factor with it.
- 4
The digits of 29223 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
\[ 29223 = 3^{2} \times 17 \times 191 \]29223 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 44928 |
| Euler totient φ(n) | 18240 |
| Square | 853983729 |
| Cube | 24955966512567 |
| Square root | 170.947360 (= 3√3247) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9223 × |
29223 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand two hundred and twenty-three |
| Binary (base 2) | 111001000100111 |
| Octal (base 8) | 71047 |
| Hexadecimal (base 16) | 7227 |
| Base 3 | 1111002100 |
| As time | 29223 seconds = 8 h 7 min 3 s |
Is 29223 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 (29223 ÷ 3 = 9741) | 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 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 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 | Yes (29223 ÷ 9 = 3247) | 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 7) | 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 29223 a prime number?
No. 29223 = × 17 × 191, so it is divisible by 3.
What are the factors of 29223?
1, 3, 9, 17, 51, 153, 191, 573, 1719, 3247, 9741, 29223.
What is 29223 in binary?
111001000100111 (hexadecimal 7227, octal 71047).
What is the square root of 29223?
About 170.9474, exactly 3√3247.
Is 29223 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 29223?
29223 is a binary palindrome (111001000100111).