The number 12752
12752 is a composite number with 10 divisors. Its prime factorisation is × 797. Divisors (10): 1, 2, 4, 8, 16, 797, 1594, 3188, 6376, 12752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12752 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12752 is composite. Its prime factorisation is
- 3
The divisors add up to 24738; without 12752 itself that is 11986, so 12752 is deficient (11986 is less than 12752). Euler's totient φ(12752) = 6368 numbers up to 12752 share no factor with it.
- 4
The digits of 12752 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12752 = 2^{4} \times 797 \]12752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 24738 |
| Euler totient φ(n) | 6368 |
| Square | 162613504 |
| Cube | 2073647403008 |
| Square root | 112.924754 (= 4√797) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 125 |
| Scientific notation | 1.2752 × |
12752 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand seven hundred and fifty-two |
| Binary (base 2) | 11000111010000 |
| Octal (base 8) | 30720 |
| Hexadecimal (base 16) | 31D0 |
| Base 3 | 122111022 |
| As time | 12752 seconds = 3 h 32 min 32 s |
Is 12752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12752 ÷ 2 = 6376) | 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 (12752 ÷ 4 = 3188) | 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 5) | 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 (12752 ÷ 8 = 1594) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12752 a prime number?
No. 12752 = × 797, so it is divisible by 2.
What are the factors of 12752?
1, 2, 4, 8, 16, 797, 1594, 3188, 6376, 12752.
What is 12752 in binary?
11000111010000 (hexadecimal 31D0, octal 30720).
What is the square root of 12752?
About 112.9248, exactly 4√797.
Is 12752 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 12752?
It is a composite number with 10 divisors.