The number 56141
56141 is a composite number with 4 divisors. Its prime factorisation is 31 × 1811. Divisors (4): 1, 31, 1811, 56141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 1811, the product of two primes.
- 2
56141 is composite. Its prime factorisation is
- 3
The divisors add up to 57984; without 56141 itself that is 1843, so 56141 is deficient (1843 is less than 56141). Euler's totient φ(56141) = 54300 numbers up to 56141 share no factor with it.
- 4
The digits of 56141 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 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56141 = 31 \times 1811 \]
56141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57984 |
| Euler totient φ(n) | 54300 |
| Square | 3151811881 |
| Cube | 176945870811221 |
| Square root | 236.940921 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.6141 × |
56141 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand one hundred and forty-one |
| Binary (base 2) | 1101101101001101 |
| Octal (base 8) | 155515 |
| Hexadecimal (base 16) | DB4D |
| Base 3 | 2212000022 |
| As time | 56141 seconds = 15 h 35 min 41 s |
Is 56141 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56141 a prime number?
No. 56141 = 31 × 1811, so it is divisible by 31.
What are the factors of 56141?
1, 31, 1811, 56141.
What is 56141 in binary?
1101101101001101 (hexadecimal DB4D, octal 155515).
What is the square root of 56141?
About 236.9409.
Is 56141 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 56141?
56141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 1811, the product of two primes.