The number 48258
48258 is a composite number with 24 divisors. Its prime factorisation is 2 × × 7 × 383. Divisors (24): 1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 63, 126, 383, 766, 1149, 2298 … 48258.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48258 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48258 is composite. Its prime factorisation is
- 3
The divisors add up to 119808; without 48258 itself that is 71550, so 48258 is abundant (71550 is more than 48258). Euler's totient φ(48258) = 13752 numbers up to 48258 share no factor with it.
- 4
The digits of 48258 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48258 = 2 \times 3^{2} \times 7 \times 383 \]48258 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 119808 |
| Euler totient φ(n) | 13752 |
| Square | 2328834564 |
| Cube | 112384898389512 |
| Square root | 219.677036 (= 3√5362) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.8258 × |
48258 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand two hundred and fifty-eight |
| Binary (base 2) | 1011110010000010 |
| Octal (base 8) | 136202 |
| Hexadecimal (base 16) | BC82 |
| Base 3 | 2110012100 |
| As time | 48258 seconds = 13 h 24 min 18 s |
Is 48258 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48258 ÷ 2 = 24129) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48258 ÷ 3 = 16086) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (48258 ÷ 6 = 8043) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (48258 ÷ 7 = 6894) | 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 (48258 ÷ 9 = 5362) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48258 a prime number?
No. 48258 = 2 × × 7 × 383, so it is divisible by 2.
What are the factors of 48258?
1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 63, 126, 383, 766, 1149, 2298, 2681, 3447, 5362, 6894, 8043, 16086, 24129, 48258.
What is 48258 in binary?
1011110010000010 (hexadecimal BC82, octal 136202).
What is the square root of 48258?
About 219.6770, exactly 3√5362.
Is 48258 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48258?
It is a composite number with 24 divisors.