The number 55159
55159 is a composite number with 4 divisors. Its prime factorisation is 13 × 4243. Divisors (4): 1, 13, 4243, 55159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55159: a semiprime: 13 × 4243, the product of two primes.
- 2
55159 is composite. Its prime factorisation is
- 3
The divisors add up to 59416; without 55159 itself that is 4257, so 55159 is deficient (4257 is less than 55159). Euler's totient φ(55159) = 50904 numbers up to 55159 share no factor with it.
- 4
The digits of 55159 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55159 = 13 \times 4243 \]
55159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59416 |
| Euler totient φ(n) | 50904 |
| Square | 3042515281 |
| Cube | 167822100384679 |
| Square root | 234.859532 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5159 × |
55159 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand one hundred and fifty-nine |
| Binary (base 2) | 1101011101110111 |
| Octal (base 8) | 153567 |
| Hexadecimal (base 16) | D777 |
| Base 3 | 2210122221 |
| As time | 55159 seconds = 15 h 19 min 19 s |
Is 55159 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55159 a prime number?
No. 55159 = 13 × 4243, so it is divisible by 13.
What are the factors of 55159?
1, 13, 4243, 55159.
What is 55159 in binary?
1101011101110111 (hexadecimal D777, octal 153567).
What is the square root of 55159?
About 234.8595.
Is 55159 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55159?
55159 is a semiprime: 13 × 4243, the product of two primes.