The number 52272
52272 is a composite number with 60 divisors. Its prime factorisation is × × . Divisors (60): 1, 2, 3, 4, 6, 8, 9, 11, 12, 16, 18, 22, 24, 27, 33, 36 … 52272.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52272: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
52272 is composite. Its prime factorisation is
- 3
The divisors add up to 164920; without 52272 itself that is 112648, so 52272 is abundant (112648 is more than 52272). Euler's totient φ(52272) = 15840 numbers up to 52272 share no factor with it.
- 4
The digits of 52272 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52272 = 2^{4} \times 3^{3} \times 11^{2} \]52272 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 60 |
| Sum of divisors | 164920 |
| Euler totient φ(n) | 15840 |
| Square | 2732361984 |
| Cube | 142826025627648 |
| Square root | 228.630707 (= 132√3) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.2272 × |
52272 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand two hundred and seventy-two |
| Binary (base 2) | 1100110000110000 |
| Octal (base 8) | 146060 |
| Hexadecimal (base 16) | CC30 |
| Base 3 | 2122201000 |
| As time | 52272 seconds = 14 h 31 min 12 s |
Is 52272 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52272 ÷ 2 = 26136) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52272 ÷ 3 = 17424) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (52272 ÷ 4 = 13068) | 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 (52272 ÷ 6 = 8712) | 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 | Yes (52272 ÷ 8 = 6534) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (52272 ÷ 9 = 5808) | 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 | Yes (52272 ÷ 11 = 4752) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (52272 ÷ 12 = 4356) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52272 a prime number?
No. 52272 = × × , so it is divisible by 2.
What are the factors of 52272?
1, 2, 3, 4, 6, 8, 9, 11, 12, 16, 18, 22, 24, 27, 33, 36, 44, 48, 54, 66, 72, 88, 99, 108, 121, 132, 144, 176, 198, 216, 242, 264, 297, 363, 396, 432, 484, 528, 594, 726, 792, 968, 1089, 1188, 1452, 1584, 1936, 2178, 2376, 2904, 3267, 4356, 4752, 5808, 6534, 8712, 13068, 17424, 26136, 52272.
What is 52272 in binary?
1100110000110000 (hexadecimal CC30, octal 146060).
What is the square root of 52272?
About 228.6307, exactly 132√3.
Is 52272 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 52272?
52272 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.