The number 48562
48562 is a composite number with 4 divisors. Its prime factorisation is 2 × 24281. Divisors (4): 1, 2, 24281, 48562.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48562: a semiprime: 2 × 24281, the product of two primes.
- 2
48562 is composite. Its prime factorisation is
- 3
The divisors add up to 72846; without 48562 itself that is 24284, so 48562 is deficient (24284 is less than 48562). Euler's totient φ(48562) = 24280 numbers up to 48562 share no factor with it.
- 4
The digits of 48562 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48562 = 2 \times 24281 \]
48562 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 72846 |
| Euler totient φ(n) | 24280 |
| Square | 2358267844 |
| Cube | 114522203040328 |
| Square root | 220.367874 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8562 × |
48562 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and sixty-two |
| Binary (base 2) | 1011110110110010 |
| Octal (base 8) | 136662 |
| Hexadecimal (base 16) | BDB2 |
| Base 3 | 2110121121 |
| As time | 48562 seconds = 13 h 29 min 22 s |
Is 48562 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48562 ÷ 2 = 24281) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48562 a prime number?
No. 48562 = 2 × 24281, so it is divisible by 2.
What are the factors of 48562?
1, 2, 24281, 48562.
What is 48562 in binary?
1011110110110010 (hexadecimal BDB2, octal 136662).
What is the square root of 48562?
About 220.3679.
Is 48562 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48562?
48562 is a semiprime: 2 × 24281, the product of two primes.