The number 29159
29159 is a composite number with 4 divisors. Its prime factorisation is 13 × 2243. Divisors (4): 1, 13, 2243, 29159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29159: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 2243, the product of two primes.
- 2
29159 is composite. Its prime factorisation is
- 3
The divisors add up to 31416; without 29159 itself that is 2257, so 29159 is deficient (2257 is less than 29159). Euler's totient φ(29159) = 26904 numbers up to 29159 share no factor with it.
- 4
The digits of 29159 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 103 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29159 = 13 \times 2243 \]
29159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 31416 |
| Euler totient φ(n) | 26904 |
| Square | 850247281 |
| Cube | 24792360466679 |
| Square root | 170.760066 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 103 |
| Scientific notation | 2.9159 × |
29159 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand one hundred and fifty-nine |
| Binary (base 2) | 111000111100111 |
| Octal (base 8) | 70747 |
| Hexadecimal (base 16) | 71E7 |
| Base 3 | 1110222222 |
| As time | 29159 seconds = 8 h 5 min 59 s |
Is 29159 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 | No (remainder 4) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 29159 a prime number?
No. 29159 = 13 × 2243, so it is divisible by 13.
What are the factors of 29159?
1, 13, 2243, 29159.
What is 29159 in binary?
111000111100111 (hexadecimal 71E7, octal 70747).
What is the square root of 29159?
About 170.7601.
Is 29159 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 29159?
29159 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 2243, the product of two primes.