The number 48260
48260 is a composite number with 24 divisors. Its prime factorisation is × 5 × 19 × 127. Divisors (24): 1, 2, 4, 5, 10, 19, 20, 38, 76, 95, 127, 190, 254, 380, 508, 635 … 48260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48260: a Harshad number: divisible by its digit sum 20.
- 2
48260 is composite. Its prime factorisation is
- 3
The divisors add up to 107520; without 48260 itself that is 59260, so 48260 is abundant (59260 is more than 48260). Euler's totient φ(48260) = 18144 numbers up to 48260 share no factor with it.
- 4
The digits of 48260 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48260 = 2^{2} \times 5 \times 19 \times 127 \]48260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 107520 |
| Euler totient φ(n) | 18144 |
| Square | 2329027600 |
| Cube | 112398871976000 |
| Square root | 219.681588 (= 2√12065) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.826 × |
48260 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand two hundred and sixty |
| Binary (base 2) | 1011110010000100 |
| Octal (base 8) | 136204 |
| Hexadecimal (base 16) | BC84 |
| Base 3 | 2110012102 |
| As time | 48260 seconds = 13 h 24 min 20 s |
Is 48260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48260 ÷ 2 = 24130) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (48260 ÷ 4 = 12065) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48260 ÷ 5 = 9652) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48260 ÷ 10 = 4826) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48260 a prime number?
No. 48260 = × 5 × 19 × 127, so it is divisible by 2.
What are the factors of 48260?
1, 2, 4, 5, 10, 19, 20, 38, 76, 95, 127, 190, 254, 380, 508, 635, 1270, 2413, 2540, 4826, 9652, 12065, 24130, 48260.
What is 48260 in binary?
1011110010000100 (hexadecimal BC84, octal 136204).
What is the square root of 48260?
About 219.6816, exactly 2√12065.
Is 48260 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48260?
48260 is a Harshad number: divisible by its digit sum 20.