The number 12592
12592 is a composite number with 10 divisors. Its prime factorisation is × 787. Divisors (10): 1, 2, 4, 8, 16, 787, 1574, 3148, 6296, 12592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12592 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12592 is composite. Its prime factorisation is
- 3
The divisors add up to 24428; without 12592 itself that is 11836, so 12592 is deficient (11836 is less than 12592). Euler's totient φ(12592) = 6288 numbers up to 12592 share no factor with it.
- 4
The digits of 12592 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12592 = 2^{4} \times 787 \]12592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 24428 |
| Euler totient φ(n) | 6288 |
| Square | 158558464 |
| Cube | 1996568178688 |
| Square root | 112.214081 (= 4√787) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2592 × |
12592 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and ninety-two |
| Binary (base 2) | 11000100110000 |
| Octal (base 8) | 30460 |
| Hexadecimal (base 16) | 3130 |
| Base 3 | 122021101 |
| As time | 12592 seconds = 3 h 29 min 52 s |
Is 12592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12592 ÷ 2 = 6296) | 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 (12592 ÷ 4 = 3148) | 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 6) | 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 (12592 ÷ 8 = 1574) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 12592 a prime number?
No. 12592 = × 787, so it is divisible by 2.
What are the factors of 12592?
1, 2, 4, 8, 16, 787, 1574, 3148, 6296, 12592.
What is 12592 in binary?
11000100110000 (hexadecimal 3130, octal 30460).
What is the square root of 12592?
About 112.2141, exactly 4√787.
Is 12592 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 12592?
It is a composite number with 10 divisors.