The number 48213
48213 is a composite number with 12 divisors. Its prime factorisation is × 11 × 487. Divisors (12): 1, 3, 9, 11, 33, 99, 487, 1461, 4383, 5357, 16071, 48213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48213: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48213 is composite. Its prime factorisation is
- 3
The divisors add up to 76128; without 48213 itself that is 27915, so 48213 is deficient (27915 is less than 48213). Euler's totient φ(48213) = 29160 numbers up to 48213 share no factor with it.
- 4
The digits of 48213 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48213 = 3^{2} \times 11 \times 487 \]48213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 76128 |
| Euler totient φ(n) | 29160 |
| Square | 2324493369 |
| Cube | 112070798799597 |
| Square root | 219.574589 (= 3√5357) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 26 |
| Scientific notation | 4.8213 × |
48213 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand two hundred and thirteen |
| Binary (base 2) | 1011110001010101 |
| Octal (base 8) | 136125 |
| Hexadecimal (base 16) | BC55 |
| Base 3 | 2110010200 |
| As time | 48213 seconds = 13 h 23 min 33 s |
Is 48213 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48213 ÷ 3 = 16071) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48213 ÷ 9 = 5357) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (48213 ÷ 11 = 4383) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48213 a prime number?
No. 48213 = × 11 × 487, so it is divisible by 3.
What are the factors of 48213?
1, 3, 9, 11, 33, 99, 487, 1461, 4383, 5357, 16071, 48213.
What is 48213 in binary?
1011110001010101 (hexadecimal BC55, octal 136125).
What is the square root of 48213?
About 219.5746, exactly 3√5357.
Is 48213 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 48213?
48213 is a happy number: repeatedly adding the squares of its digits reaches 1.