The number 9052
9052 is a composite number with 12 divisors. Its prime factorisation is × 31 × 73. Divisors (12): 1, 2, 4, 31, 62, 73, 124, 146, 292, 2263, 4526, 9052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9052 is composite. Its prime factorisation is
- 3
The divisors add up to 16576; without 9052 itself that is 7524, so 9052 is deficient (7524 is less than 9052). Euler's totient φ(9052) = 4320 numbers up to 9052 share no factor with it.
- 4
The digits of 9052 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9052 = 2^{2} \times 31 \times 73 \]9052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 16576 |
| Euler totient φ(n) | 4320 |
| Square | 81938704 |
| Cube | 741709148608 |
| Square root | 95.141999 (= 2√2263) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 39 |
| Scientific notation | 9.052 × |
9052 in other forms
| Form | Value |
|---|---|
| In words | nine thousand and fifty-two |
| Binary (base 2) | 10001101011100 |
| Octal (base 8) | 21534 |
| Hexadecimal (base 16) | 235C |
| Base 3 | 110102021 |
| As time | 9052 seconds = 2 h 30 min 52 s |
Is 9052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9052 ÷ 2 = 4526) | 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 (9052 ÷ 4 = 2263) | 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 1) | 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 7) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9052 a prime number?
No. 9052 = × 31 × 73, so it is divisible by 2.
What are the factors of 9052?
1, 2, 4, 31, 62, 73, 124, 146, 292, 2263, 4526, 9052.
What is 9052 in binary?
10001101011100 (hexadecimal 235C, octal 21534).
What is the square root of 9052?
About 95.1420, exactly 2√2263.
Is 9052 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 9052?
It is a composite number with 12 divisors.