The number 55141
55141 is a composite number with 4 divisors. Its prime factorisation is 67 × 823. Divisors (4): 1, 67, 823, 55141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 67 × 823, the product of two primes.
- 2
55141 is composite. Its prime factorisation is
- 3
The divisors add up to 56032; without 55141 itself that is 891, so 55141 is deficient (891 is less than 55141). Euler's totient φ(55141) = 54252 numbers up to 55141 share no factor with it.
- 4
The digits of 55141 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55141 = 67 \times 823 \]
55141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56032 |
| Euler totient φ(n) | 54252 |
| Square | 3040529881 |
| Cube | 167657858168221 |
| Square root | 234.821209 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5141 × |
55141 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand one hundred and forty-one |
| Binary (base 2) | 1101011101100101 |
| Octal (base 8) | 153545 |
| Hexadecimal (base 16) | D765 |
| Base 3 | 2210122021 |
| As time | 55141 seconds = 15 h 19 min 1 s |
Is 55141 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55141 a prime number?
No. 55141 = 67 × 823, so it is divisible by 67.
What are the factors of 55141?
1, 67, 823, 55141.
What is 55141 in binary?
1101011101100101 (hexadecimal D765, octal 153545).
What is the square root of 55141?
About 234.8212.
Is 55141 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 55141?
55141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 67 × 823, the product of two primes.