The number 12565
12565 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 359. Divisors (8): 1, 5, 7, 35, 359, 1795, 2513, 12565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12565: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
12565 is composite. Its prime factorisation is
- 3
The divisors add up to 17280; without 12565 itself that is 4715, so 12565 is deficient (4715 is less than 12565). Euler's totient φ(12565) = 8592 numbers up to 12565 share no factor with it.
- 4
The digits of 12565 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 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12565 = 5 \times 7 \times 359 \]
12565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17280 |
| Euler totient φ(n) | 8592 |
| Square | 157879225 |
| Cube | 1983752462125 |
| Square root | 112.093711 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 125 |
| Scientific notation | 1.2565 × |
12565 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and sixty-five |
| Binary (base 2) | 11000100010101 |
| Octal (base 8) | 30425 |
| Hexadecimal (base 16) | 3115 |
| Base 3 | 122020101 |
| As time | 12565 seconds = 3 h 29 min 25 s |
Is 12565 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 | No (remainder 1) | 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 | Yes (12565 ÷ 5 = 2513) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12565 ÷ 7 = 1795) | 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 5) | 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 5) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12565 a prime number?
No. 12565 = 5 × 7 × 359, so it is divisible by 5.
What are the factors of 12565?
1, 5, 7, 35, 359, 1795, 2513, 12565.
What is 12565 in binary?
11000100010101 (hexadecimal 3115, octal 30425).
What is the square root of 12565?
About 112.0937.
Is 12565 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 12565?
12565 is a happy number: repeatedly adding the squares of its digits reaches 1.