The number 12561
12561 is a triangular number: 1 + 2 + … + 158 = 12561. Its prime factorisation is 3 × 53 × 79. Divisors (8): 1, 3, 53, 79, 159, 237, 4187, 12561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12561: a triangular number: 1 + 2 + … + 158 = 12561.
- 2
12561 is composite. Its prime factorisation is
- 3
The divisors add up to 17280; without 12561 itself that is 4719, so 12561 is deficient (4719 is less than 12561). Euler's totient φ(12561) = 8112 numbers up to 12561 share no factor with it.
- 4
The digits of 12561 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12561 = 3 \times 53 \times 79 \]
12561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17280 |
| Euler totient φ(n) | 8112 |
| Square | 157778721 |
| Cube | 1981858514481 |
| Square root | 112.075867 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.2561 × |
12561 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and sixty-one |
| Binary (base 2) | 11000100010001 |
| Octal (base 8) | 30421 |
| Hexadecimal (base 16) | 3111 |
| Base 3 | 122020020 |
| As time | 12561 seconds = 3 h 29 min 21 s |
Is 12561 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 (12561 ÷ 3 = 4187) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | No (remainder 3) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12561 a prime number?
No. 12561 = 3 × 53 × 79, so it is divisible by 3.
What are the factors of 12561?
1, 3, 53, 79, 159, 237, 4187, 12561.
What is 12561 in binary?
11000100010001 (hexadecimal 3111, octal 30421).
What is the square root of 12561?
About 112.0759.
Is 12561 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 12561?
12561 is a triangular number: 1 + 2 + … + 158 = 12561.