The number 12579
12579 is a binary palindrome (11000100100011). Its prime factorisation is 3 × 7 × 599. Divisors (8): 1, 3, 7, 21, 599, 1797, 4193, 12579.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12579: a binary palindrome (11000100100011).
- 2
12579 is composite. Its prime factorisation is
- 3
The divisors add up to 19200; without 12579 itself that is 6621, so 12579 is deficient (6621 is less than 12579). Euler's totient φ(12579) = 7176 numbers up to 12579 share no factor with it.
- 4
The digits of 12579 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12579 = 3 \times 7 \times 599 \]
12579 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19200 |
| Euler totient φ(n) | 7176 |
| Square | 158231241 |
| Cube | 1990390780539 |
| Square root | 112.156141 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2579 × |
12579 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and seventy-nine |
| Binary (base 2) | 11000100100011 |
| Octal (base 8) | 30443 |
| Hexadecimal (base 16) | 3123 |
| Base 3 | 122020220 |
| As time | 12579 seconds = 3 h 29 min 39 s |
Is 12579 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12579 ÷ 3 = 4193) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12579 ÷ 7 = 1797) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12579 a prime number?
No. 12579 = 3 × 7 × 599, so it is divisible by 3.
What are the factors of 12579?
1, 3, 7, 21, 599, 1797, 4193, 12579.
What is 12579 in binary?
11000100100011 (hexadecimal 3123, octal 30443).
What is the square root of 12579?
About 112.1561.
Is 12579 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 12579?
12579 is a binary palindrome (11000100100011).