The number 12567
12567 is a composite number with 8 divisors. Its prime factorisation is 3 × 59 × 71. Divisors (8): 1, 3, 59, 71, 177, 213, 4189, 12567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12567 is composite. Its prime factorisation is
- 3
The divisors add up to 17280; without 12567 itself that is 4713, so 12567 is deficient (4713 is less than 12567). Euler's totient φ(12567) = 8120 numbers up to 12567 share no factor with it.
- 4
The digits of 12567 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12567 = 3 \times 59 \times 71 \]
12567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17280 |
| Euler totient φ(n) | 8120 |
| Square | 157929489 |
| Cube | 1984699888263 |
| Square root | 112.102632 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 156 |
| Scientific notation | 1.2567 × |
12567 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and sixty-seven |
| Binary (base 2) | 11000100010111 |
| Octal (base 8) | 30427 |
| Hexadecimal (base 16) | 3117 |
| Base 3 | 122020110 |
| As time | 12567 seconds = 3 h 29 min 27 s |
Is 12567 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 (12567 ÷ 3 = 4189) | 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 2) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 12567 a prime number?
No. 12567 = 3 × 59 × 71, so it is divisible by 3.
What are the factors of 12567?
1, 3, 59, 71, 177, 213, 4189, 12567.
What is 12567 in binary?
11000100010111 (hexadecimal 3117, octal 30427).
What is the square root of 12567?
About 112.1026.
Is 12567 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 12567?
It is a composite number with 8 divisors.