The number 48141
48141 is a composite number with 8 divisors. Its prime factorisation is × 1783. Divisors (8): 1, 3, 9, 27, 1783, 5349, 16047, 48141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48141 is composite. Its prime factorisation is
- 3
The divisors add up to 71360; without 48141 itself that is 23219, so 48141 is deficient (23219 is less than 48141). Euler's totient φ(48141) = 32076 numbers up to 48141 share no factor with it.
- 4
The digits of 48141 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48141 = 3^{3} \times 1783 \]48141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71360 |
| Euler totient φ(n) | 32076 |
| Square | 2317555881 |
| Cube | 111569457667221 |
| Square root | 219.410574 (= 3√5349) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8141 × |
48141 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand one hundred and forty-one |
| Binary (base 2) | 1011110000001101 |
| Octal (base 8) | 136015 |
| Hexadecimal (base 16) | BC0D |
| Base 3 | 2110001000 |
| As time | 48141 seconds = 13 h 22 min 21 s |
Is 48141 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 (48141 ÷ 3 = 16047) | 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 | Yes (48141 ÷ 9 = 5349) | 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 5) | 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 48141 a prime number?
No. 48141 = × 1783, so it is divisible by 3.
What are the factors of 48141?
1, 3, 9, 27, 1783, 5349, 16047, 48141.
What is 48141 in binary?
1011110000001101 (hexadecimal BC0D, octal 136015).
What is the square root of 48141?
About 219.4106, exactly 3√5349.
Is 48141 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 48141?
It is a composite number with 8 divisors.