The number 48052
48052 is a composite number with 12 divisors. Its prime factorisation is × 41 × 293. Divisors (12): 1, 2, 4, 41, 82, 164, 293, 586, 1172, 12013, 24026, 48052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48052: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48052 is composite. Its prime factorisation is
- 3
The divisors add up to 86436; without 48052 itself that is 38384, so 48052 is deficient (38384 is less than 48052). Euler's totient φ(48052) = 23360 numbers up to 48052 share no factor with it.
- 4
The digits of 48052 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48052 = 2^{2} \times 41 \times 293 \]48052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86436 |
| Euler totient φ(n) | 23360 |
| Square | 2308994704 |
| Cube | 110951813516608 |
| Square root | 219.207664 (= 2√12013) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8052 × |
48052 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and fifty-two |
| Binary (base 2) | 1011101110110100 |
| Octal (base 8) | 135664 |
| Hexadecimal (base 16) | BBB4 |
| Base 3 | 2102220201 |
| As time | 48052 seconds = 13 h 20 min 52 s |
Is 48052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48052 ÷ 2 = 24026) | 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 | Yes (48052 ÷ 4 = 12013) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48052 a prime number?
No. 48052 = × 41 × 293, so it is divisible by 2.
What are the factors of 48052?
1, 2, 4, 41, 82, 164, 293, 586, 1172, 12013, 24026, 48052.
What is 48052 in binary?
1011101110110100 (hexadecimal BBB4, octal 135664).
What is the square root of 48052?
About 219.2077, exactly 2√12013.
Is 48052 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 48052?
48052 is a happy number: repeatedly adding the squares of its digits reaches 1.