The number 51141
51141 is a composite number with 4 divisors. Its prime factorisation is 3 × 17047. Divisors (4): 1, 3, 17047, 51141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 17047, the product of two primes.
- 2
51141 is composite. Its prime factorisation is
- 3
The divisors add up to 68192; without 51141 itself that is 17051, so 51141 is deficient (17051 is less than 51141). Euler's totient φ(51141) = 34092 numbers up to 51141 share no factor with it.
- 4
The digits of 51141 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51141 = 3 \times 17047 \]
51141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68192 |
| Euler totient φ(n) | 34092 |
| Square | 2615401881 |
| Cube | 133754267596221 |
| Square root | 226.143760 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1141 × |
51141 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and forty-one |
| Binary (base 2) | 1100011111000101 |
| Octal (base 8) | 143705 |
| Hexadecimal (base 16) | C7C5 |
| Base 3 | 2121011010 |
| As time | 51141 seconds = 14 h 12 min 21 s |
Is 51141 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 | Yes (51141 ÷ 3 = 17047) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51141 a prime number?
No. 51141 = 3 × 17047, so it is divisible by 3.
What are the factors of 51141?
1, 3, 17047, 51141.
What is 51141 in binary?
1100011111000101 (hexadecimal C7C5, octal 143705).
What is the square root of 51141?
About 226.1438.
Is 51141 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51141?
51141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 17047, the product of two primes.