The number 13252
13252 is a composite number with 6 divisors. Its prime factorisation is × 3313. Divisors (6): 1, 2, 4, 3313, 6626, 13252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13252 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13252 is composite. Its prime factorisation is
- 3
The divisors add up to 23198; without 13252 itself that is 9946, so 13252 is deficient (9946 is less than 13252). Euler's totient φ(13252) = 6624 numbers up to 13252 share no factor with it.
- 4
The digits of 13252 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13252 = 2^{2} \times 3313 \]13252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 23198 |
| Euler totient φ(n) | 6624 |
| Square | 175615504 |
| Cube | 2327256659008 |
| Square root | 115.117331 (= 2√3313) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.3252 × |
13252 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand two hundred and fifty-two |
| Binary (base 2) | 11001111000100 |
| Octal (base 8) | 31704 |
| Hexadecimal (base 16) | 33C4 |
| Base 3 | 200011211 |
| As time | 13252 seconds = 3 h 40 min 52 s |
Is 13252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13252 ÷ 2 = 6626) | 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 (13252 ÷ 4 = 3313) | 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 4) | 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 8) | 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 13252 a prime number?
No. 13252 = × 3313, so it is divisible by 2.
What are the factors of 13252?
1, 2, 4, 3313, 6626, 13252.
What is 13252 in binary?
11001111000100 (hexadecimal 33C4, octal 31704).
What is the square root of 13252?
About 115.1173, exactly 2√3313.
Is 13252 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 13252?
It is a composite number with 6 divisors.