The number 48690
48690 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 541. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 541, 1082, 1623, 2705 … 48690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48690 is composite. Its prime factorisation is
- 3
The divisors add up to 126828; without 48690 itself that is 78138, so 48690 is abundant (78138 is more than 48690). Euler's totient φ(48690) = 12960 numbers up to 48690 share no factor with it.
- 4
The digits of 48690 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48690 = 2 \times 3^{2} \times 5 \times 541 \]48690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 126828 |
| Euler totient φ(n) | 12960 |
| Square | 2370716100 |
| Cube | 115430166909000 |
| Square root | 220.658107 (= 3√5410) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.869 × |
48690 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand six hundred and ninety |
| Binary (base 2) | 1011111000110010 |
| Octal (base 8) | 137062 |
| Hexadecimal (base 16) | BE32 |
| Base 3 | 2110210100 |
| As time | 48690 seconds = 13 h 31 min 30 s |
Is 48690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48690 ÷ 2 = 24345) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48690 ÷ 3 = 16230) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48690 ÷ 5 = 9738) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (48690 ÷ 6 = 8115) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48690 ÷ 9 = 5410) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48690 ÷ 10 = 4869) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48690 a prime number?
No. 48690 = 2 × × 5 × 541, so it is divisible by 2.
What are the factors of 48690?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 541, 1082, 1623, 2705, 3246, 4869, 5410, 8115, 9738, 16230, 24345, 48690.
What is 48690 in binary?
1011111000110010 (hexadecimal BE32, octal 137062).
What is the square root of 48690?
About 220.6581, exactly 3√5410.
Is 48690 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48690?
It is a composite number with 24 divisors.