The number 55151
55151 is a composite number with 4 divisors. Its prime factorisation is 131 × 421. Divisors (4): 1, 131, 421, 55151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55151: a semiprime: 131 × 421, the product of two primes.
- 2
55151 is composite. Its prime factorisation is
- 3
The divisors add up to 55704; without 55151 itself that is 553, so 55151 is deficient (553 is less than 55151). Euler's totient φ(55151) = 54600 numbers up to 55151 share no factor with it.
- 4
The digits of 55151 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55151 = 131 \times 421 \]
55151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55704 |
| Euler totient φ(n) | 54600 |
| Square | 3041632801 |
| Cube | 167749090607951 |
| Square root | 234.842500 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5151 × |
55151 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand one hundred and fifty-one |
| Binary (base 2) | 1101011101101111 |
| Octal (base 8) | 153557 |
| Hexadecimal (base 16) | D76F |
| Base 3 | 2210122122 |
| As time | 55151 seconds = 15 h 19 min 11 s |
Is 55151 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 1) | 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 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 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 55151 a prime number?
No. 55151 = 131 × 421, so it is divisible by 131.
What are the factors of 55151?
1, 131, 421, 55151.
What is 55151 in binary?
1101011101101111 (hexadecimal D76F, octal 153557).
What is the square root of 55151?
About 234.8425.
Is 55151 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 55151?
55151 is a semiprime: 131 × 421, the product of two primes.