The number 47052
47052 is a composite number with 18 divisors. Its prime factorisation is × × 1307. Divisors (18): 1, 2, 3, 4, 6, 9, 12, 18, 36, 1307, 2614, 3921, 5228, 7842, 11763, 15684 … 47052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47052: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
47052 is composite. Its prime factorisation is
- 3
The divisors add up to 119028; without 47052 itself that is 71976, so 47052 is abundant (71976 is more than 47052). Euler's totient φ(47052) = 15672 numbers up to 47052 share no factor with it.
- 4
The digits of 47052 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47052 = 2^{2} \times 3^{2} \times 1307 \]47052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 119028 |
| Euler totient φ(n) | 15672 |
| Square | 2213890704 |
| Cube | 104167985404608 |
| Square root | 216.914730 (= 6√1307) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7052 × |
47052 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand and fifty-two |
| Binary (base 2) | 1011011111001100 |
| Octal (base 8) | 133714 |
| Hexadecimal (base 16) | B7CC |
| Base 3 | 2101112200 |
| As time | 47052 seconds = 13 h 4 min 12 s |
Is 47052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47052 ÷ 2 = 23526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (47052 ÷ 3 = 15684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (47052 ÷ 4 = 11763) | 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 (47052 ÷ 6 = 7842) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (47052 ÷ 9 = 5228) | 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 | Yes (47052 ÷ 12 = 3921) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47052 a prime number?
No. 47052 = × × 1307, so it is divisible by 2.
What are the factors of 47052?
1, 2, 3, 4, 6, 9, 12, 18, 36, 1307, 2614, 3921, 5228, 7842, 11763, 15684, 23526, 47052.
What is 47052 in binary?
1011011111001100 (hexadecimal B7CC, octal 133714).
What is the square root of 47052?
About 216.9147, exactly 6√1307.
Is 47052 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 47052?
47052 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.