The number 29127
29127 is a binary palindrome (111000111000111). Its prime factorisation is 3 × 7 × 19 × 73. Divisors (16): 1, 3, 7, 19, 21, 57, 73, 133, 219, 399, 511, 1387, 1533, 4161, 9709, 29127.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29127: a binary palindrome (111000111000111); a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
29127 is composite. Its prime factorisation is
- 3
The divisors add up to 47360; without 29127 itself that is 18233, so 29127 is deficient (18233 is less than 29127). Euler's totient φ(29127) = 15552 numbers up to 29127 share no factor with it.
- 4
The digits of 29127 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 103 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29127 = 3 \times 7 \times 19 \times 73 \]
29127 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 47360 |
| Euler totient φ(n) | 15552 |
| Square | 848382129 |
| Cube | 24710826271383 |
| Square root | 170.666341 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 103 |
| Scientific notation | 2.9127 × |
29127 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand one hundred and twenty-seven |
| Binary (base 2) | 111000111000111 |
| Octal (base 8) | 70707 |
| Hexadecimal (base 16) | 71C7 |
| Base 3 | 1110221210 |
| As time | 29127 seconds = 8 h 5 min 27 s |
Is 29127 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 (29127 ÷ 3 = 9709) | 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 2) | 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 | Yes (29127 ÷ 7 = 4161) | 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 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29127 a prime number?
No. 29127 = 3 × 7 × 19 × 73, so it is divisible by 3.
What are the factors of 29127?
1, 3, 7, 19, 21, 57, 73, 133, 219, 399, 511, 1387, 1533, 4161, 9709, 29127.
What is 29127 in binary?
111000111000111 (hexadecimal 71C7, octal 70707).
What is the square root of 29127?
About 170.6663.
Is 29127 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 29127?
29127 is a binary palindrome (111000111000111); a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.