The number 48962
48962 is a composite number with 4 divisors. Its prime factorisation is 2 × 24481. Divisors (4): 1, 2, 24481, 48962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48962: a semiprime: 2 × 24481, the product of two primes.
- 2
48962 is composite. Its prime factorisation is
- 3
The divisors add up to 73446; without 48962 itself that is 24484, so 48962 is deficient (24484 is less than 48962). Euler's totient φ(48962) = 24480 numbers up to 48962 share no factor with it.
- 4
The digits of 48962 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48962 = 2 \times 24481 \]
48962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 73446 |
| Euler totient φ(n) | 24480 |
| Square | 2397277444 |
| Cube | 117375498213128 |
| Square root | 221.273586 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8962 × |
48962 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and sixty-two |
| Binary (base 2) | 1011111101000010 |
| Octal (base 8) | 137502 |
| Hexadecimal (base 16) | BF42 |
| Base 3 | 2111011102 |
| As time | 48962 seconds = 13 h 36 min 2 s |
Is 48962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48962 ÷ 2 = 24481) | 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 2) | 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 4) | 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 2) | 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 1) | 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 48962 a prime number?
No. 48962 = 2 × 24481, so it is divisible by 2.
What are the factors of 48962?
1, 2, 24481, 48962.
What is 48962 in binary?
1011111101000010 (hexadecimal BF42, octal 137502).
What is the square root of 48962?
About 221.2736.
Is 48962 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 48962?
48962 is a semiprime: 2 × 24481, the product of two primes.