The number 6141
6141 is a binary palindrome (1011111111101). Its prime factorisation is 3 × 23 × 89. Divisors (8): 1, 3, 23, 69, 89, 267, 2047, 6141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6141: a binary palindrome (1011111111101).
- 2
6141 is composite. Its prime factorisation is
- 3
The divisors add up to 8640; without 6141 itself that is 2499, so 6141 is deficient (2499 is less than 6141). Euler's totient φ(6141) = 3872 numbers up to 6141 share no factor with it.
- 4
The digits of 6141 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 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6141 = 3 \times 23 \times 89 \]
6141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8640 |
| Euler totient φ(n) | 3872 |
| Square | 37711881 |
| Cube | 231588661221 |
| Square root | 78.364533 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 62 |
| Scientific notation | 6.141 × |
6141 in other forms
| Form | Value |
|---|---|
| In words | six thousand one hundred and forty-one |
| Binary (base 2) | 1011111111101 |
| Octal (base 8) | 13775 |
| Hexadecimal (base 16) | 17FD |
| Base 3 | 22102110 |
| As time | 6141 seconds = 1 h 42 min 21 s |
Is 6141 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 (6141 ÷ 3 = 2047) | 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 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 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 3) | 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 6141 a prime number?
No. 6141 = 3 × 23 × 89, so it is divisible by 3.
What are the factors of 6141?
1, 3, 23, 69, 89, 267, 2047, 6141.
What is 6141 in binary?
1011111111101 (hexadecimal 17FD, octal 13775).
What is the square root of 6141?
About 78.3645.
Is 6141 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 6141?
6141 is a binary palindrome (1011111111101).