The number 63141
63141 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1619. Divisors (8): 1, 3, 13, 39, 1619, 4857, 21047, 63141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63141 is composite. Its prime factorisation is
- 3
The divisors add up to 90720; without 63141 itself that is 27579, so 63141 is deficient (27579 is less than 63141). Euler's totient φ(63141) = 38832 numbers up to 63141 share no factor with it.
- 4
The digits of 63141 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63141 = 3 \times 13 \times 1619 \]
63141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90720 |
| Euler totient φ(n) | 38832 |
| Square | 3986785881 |
| Cube | 251729647312221 |
| Square root | 251.278730 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.3141 × |
63141 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand one hundred and forty-one |
| Binary (base 2) | 1111011010100101 |
| Octal (base 8) | 173245 |
| Hexadecimal (base 16) | F6A5 |
| Base 3 | 10012121120 |
| As time | 63141 seconds = 17 h 32 min 21 s |
Is 63141 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 (63141 ÷ 3 = 21047) | 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 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 6) | 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 1) | 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 63141 a prime number?
No. 63141 = 3 × 13 × 1619, so it is divisible by 3.
What are the factors of 63141?
1, 3, 13, 39, 1619, 4857, 21047, 63141.
What is 63141 in binary?
1111011010100101 (hexadecimal F6A5, octal 173245).
What is the square root of 63141?
About 251.2787.
Is 63141 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 63141?
It is a composite number with 8 divisors.