The number 48212
48212 is a composite number with 12 divisors. Its prime factorisation is × 17 × 709. Divisors (12): 1, 2, 4, 17, 34, 68, 709, 1418, 2836, 12053, 24106, 48212.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48212: a Harshad number: divisible by its digit sum 17.
- 2
48212 is composite. Its prime factorisation is
- 3
The divisors add up to 89460; without 48212 itself that is 41248, so 48212 is deficient (41248 is less than 48212). Euler's totient φ(48212) = 22656 numbers up to 48212 share no factor with it.
- 4
The digits of 48212 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48212 = 2^{2} \times 17 \times 709 \]48212 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 89460 |
| Euler totient φ(n) | 22656 |
| Square | 2324396944 |
| Cube | 112063825464128 |
| Square root | 219.572312 (= 2√12053) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 26 |
| Scientific notation | 4.8212 × |
48212 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand two hundred and twelve |
| Binary (base 2) | 1011110001010100 |
| Octal (base 8) | 136124 |
| Hexadecimal (base 16) | BC54 |
| Base 3 | 2110010122 |
| As time | 48212 seconds = 13 h 23 min 32 s |
Is 48212 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48212 ÷ 2 = 24106) | 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 | Yes (48212 ÷ 4 = 12053) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48212 a prime number?
No. 48212 = × 17 × 709, so it is divisible by 2.
What are the factors of 48212?
1, 2, 4, 17, 34, 68, 709, 1418, 2836, 12053, 24106, 48212.
What is 48212 in binary?
1011110001010100 (hexadecimal BC54, octal 136124).
What is the square root of 48212?
About 219.5723, exactly 2√12053.
Is 48212 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 48212?
48212 is a Harshad number: divisible by its digit sum 17.