The number 48681
48681 is a composite number with 10 divisors. Its prime factorisation is × 601. Divisors (10): 1, 3, 9, 27, 81, 601, 1803, 5409, 16227, 48681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48681: a Harshad number: divisible by its digit sum 27.
- 2
48681 is composite. Its prime factorisation is
- 3
The divisors add up to 72842; without 48681 itself that is 24161, so 48681 is deficient (24161 is less than 48681). Euler's totient φ(48681) = 32400 numbers up to 48681 share no factor with it.
- 4
The digits of 48681 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48681 = 3^{4} \times 601 \]48681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 72842 |
| Euler totient φ(n) | 32400 |
| Square | 2369839761 |
| Cube | 115366169405241 |
| Square root | 220.637712 (= 9√601) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8681 × |
48681 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand six hundred and eighty-one |
| Binary (base 2) | 1011111000101001 |
| Octal (base 8) | 137051 |
| Hexadecimal (base 16) | BE29 |
| Base 3 | 2110210000 |
| As time | 48681 seconds = 13 h 31 min 21 s |
Is 48681 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 (48681 ÷ 3 = 16227) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48681 ÷ 9 = 5409) | 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 6) | 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 48681 a prime number?
No. 48681 = × 601, so it is divisible by 3.
What are the factors of 48681?
1, 3, 9, 27, 81, 601, 1803, 5409, 16227, 48681.
What is 48681 in binary?
1011111000101001 (hexadecimal BE29, octal 137051).
What is the square root of 48681?
About 220.6377, exactly 9√601.
Is 48681 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48681?
48681 is a Harshad number: divisible by its digit sum 27.