The number 48922
48922 is a composite number with 8 divisors. Its prime factorisation is 2 × 61 × 401. Divisors (8): 1, 2, 61, 122, 401, 802, 24461, 48922.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48922 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48922 is composite. Its prime factorisation is
- 3
The divisors add up to 74772; without 48922 itself that is 25850, so 48922 is deficient (25850 is less than 48922). Euler's totient φ(48922) = 24000 numbers up to 48922 share no factor with it.
- 4
The digits of 48922 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48922 = 2 \times 61 \times 401 \]
48922 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74772 |
| Euler totient φ(n) | 24000 |
| Square | 2393362084 |
| Cube | 117088059873448 |
| Square root | 221.183182 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.8922 × |
48922 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and twenty-two |
| Binary (base 2) | 1011111100011010 |
| Octal (base 8) | 137432 |
| Hexadecimal (base 16) | BF1A |
| Base 3 | 2111002221 |
| As time | 48922 seconds = 13 h 35 min 22 s |
Is 48922 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48922 ÷ 2 = 24461) | 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 6) | 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 5) | 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 48922 a prime number?
No. 48922 = 2 × 61 × 401, so it is divisible by 2.
What are the factors of 48922?
1, 2, 61, 122, 401, 802, 24461, 48922.
What is 48922 in binary?
1011111100011010 (hexadecimal BF1A, octal 137432).
What is the square root of 48922?
About 221.1832.
Is 48922 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48922?
It is a composite number with 8 divisors.