The number 13052
13052 is a composite number with 12 divisors. Its prime factorisation is × 13 × 251. Divisors (12): 1, 2, 4, 13, 26, 52, 251, 502, 1004, 3263, 6526, 13052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13052 is composite. Its prime factorisation is
- 3
The divisors add up to 24696; without 13052 itself that is 11644, so 13052 is deficient (11644 is less than 13052). Euler's totient φ(13052) = 6000 numbers up to 13052 share no factor with it.
- 4
The digits of 13052 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13052 = 2^{2} \times 13 \times 251 \]13052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 24696 |
| Euler totient φ(n) | 6000 |
| Square | 170354704 |
| Cube | 2223469596608 |
| Square root | 114.245350 (= 2√3263) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.3052 × |
13052 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand and fifty-two |
| Binary (base 2) | 11001011111100 |
| Octal (base 8) | 31374 |
| Hexadecimal (base 16) | 32FC |
| Base 3 | 122220102 |
| As time | 13052 seconds = 3 h 37 min 32 s |
Is 13052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13052 ÷ 2 = 6526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (13052 ÷ 4 = 3263) | 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 2) | 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 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13052 a prime number?
No. 13052 = × 13 × 251, so it is divisible by 2.
What are the factors of 13052?
1, 2, 4, 13, 26, 52, 251, 502, 1004, 3263, 6526, 13052.
What is 13052 in binary?
11001011111100 (hexadecimal 32FC, octal 31374).
What is the square root of 13052?
About 114.2454, exactly 2√3263.
Is 13052 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 13052?
It is a composite number with 12 divisors.