The number 47922
47922 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 163. Divisors (24): 1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 163, 294, 326, 489, 978 … 47922.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47922 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47922 is composite. Its prime factorisation is
- 3
The divisors add up to 112176; without 47922 itself that is 64254, so 47922 is abundant (64254 is more than 47922). Euler's totient φ(47922) = 13608 numbers up to 47922 share no factor with it.
- 4
The digits of 47922 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47922 = 2 \times 3 \times 7^{2} \times 163 \]47922 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 112176 |
| Euler totient φ(n) | 13608 |
| Square | 2296518084 |
| Cube | 110053739621448 |
| Square root | 218.910941 (= 7√978) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.7922 × |
47922 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and twenty-two |
| Binary (base 2) | 1011101100110010 |
| Octal (base 8) | 135462 |
| Hexadecimal (base 16) | BB32 |
| Base 3 | 2102201220 |
| As time | 47922 seconds = 13 h 18 min 42 s |
Is 47922 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47922 ÷ 2 = 23961) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (47922 ÷ 3 = 15974) | 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 | Yes (47922 ÷ 6 = 7987) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (47922 ÷ 7 = 6846) | 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 6) | 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 6) | 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 47922 a prime number?
No. 47922 = 2 × 3 × × 163, so it is divisible by 2.
What are the factors of 47922?
1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 163, 294, 326, 489, 978, 1141, 2282, 3423, 6846, 7987, 15974, 23961, 47922.
What is 47922 in binary?
1011101100110010 (hexadecimal BB32, octal 135462).
What is the square root of 47922?
About 218.9109, exactly 7√978.
Is 47922 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 47922?
It is a composite number with 24 divisors.