The number 12532
12532 is a composite number with 12 divisors. Its prime factorisation is × 13 × 241. Divisors (12): 1, 2, 4, 13, 26, 52, 241, 482, 964, 3133, 6266, 12532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12532: a Harshad number: divisible by its digit sum 13.
- 2
12532 is composite. Its prime factorisation is
- 3
The divisors add up to 23716; without 12532 itself that is 11184, so 12532 is deficient (11184 is less than 12532). Euler's totient φ(12532) = 5760 numbers up to 12532 share no factor with it.
- 4
The digits of 12532 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 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12532 = 2^{2} \times 13 \times 241 \]12532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 23716 |
| Euler totient φ(n) | 5760 |
| Square | 157051024 |
| Cube | 1968163432768 |
| Square root | 111.946416 (= 2√3133) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 125 |
| Scientific notation | 1.2532 × |
12532 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and thirty-two |
| Binary (base 2) | 11000011110100 |
| Octal (base 8) | 30364 |
| Hexadecimal (base 16) | 30F4 |
| Base 3 | 122012011 |
| As time | 12532 seconds = 3 h 28 min 52 s |
Is 12532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12532 ÷ 2 = 6266) | 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 (12532 ÷ 4 = 3133) | 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 2) | 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 3) | 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 12532 a prime number?
No. 12532 = × 13 × 241, so it is divisible by 2.
What are the factors of 12532?
1, 2, 4, 13, 26, 52, 241, 482, 964, 3133, 6266, 12532.
What is 12532 in binary?
11000011110100 (hexadecimal 30F4, octal 30364).
What is the square root of 12532?
About 111.9464, exactly 2√3133.
Is 12532 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 12532?
12532 is a Harshad number: divisible by its digit sum 13.