The number 48254
48254 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 1049. Divisors (8): 1, 2, 23, 46, 1049, 2098, 24127, 48254.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48254: a Harshad number: divisible by its digit sum 23.
- 2
48254 is composite. Its prime factorisation is
- 3
The divisors add up to 75600; without 48254 itself that is 27346, so 48254 is deficient (27346 is less than 48254). Euler's totient φ(48254) = 23056 numbers up to 48254 share no factor with it.
- 4
The digits of 48254 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48254 = 2 \times 23 \times 1049 \]
48254 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75600 |
| Euler totient φ(n) | 23056 |
| Square | 2328448516 |
| Cube | 112356954691064 |
| Square root | 219.667931 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8254 × |
48254 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand two hundred and fifty-four |
| Binary (base 2) | 1011110001111110 |
| Octal (base 8) | 136176 |
| Hexadecimal (base 16) | BC7E |
| Base 3 | 2110012012 |
| As time | 48254 seconds = 13 h 24 min 14 s |
Is 48254 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48254 ÷ 2 = 24127) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48254 a prime number?
No. 48254 = 2 × 23 × 1049, so it is divisible by 2.
What are the factors of 48254?
1, 2, 23, 46, 1049, 2098, 24127, 48254.
What is 48254 in binary?
1011110001111110 (hexadecimal BC7E, octal 136176).
What is the square root of 48254?
About 219.6679.
Is 48254 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48254?
48254 is a Harshad number: divisible by its digit sum 23.