The number 12570
12570 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 419. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 419, 838, 1257, 2095, 2514, 4190, 6285, 12570.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12570: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.
- 2
12570 is composite. Its prime factorisation is
- 3
The divisors add up to 30240; without 12570 itself that is 17670, so 12570 is abundant (17670 is more than 12570). Euler's totient φ(12570) = 3344 numbers up to 12570 share no factor with it.
- 4
The digits of 12570 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 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12570 = 2 \times 3 \times 5 \times 419 \]
12570 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 30240 |
| Euler totient φ(n) | 3344 |
| Square | 158004900 |
| Cube | 1986121593000 |
| Square root | 112.116011 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 125 |
| Scientific notation | 1.257 × |
12570 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and seventy |
| Binary (base 2) | 11000100011010 |
| Octal (base 8) | 30432 |
| Hexadecimal (base 16) | 311A |
| Base 3 | 122020120 |
| As time | 12570 seconds = 3 h 29 min 30 s |
Is 12570 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12570 ÷ 2 = 6285) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12570 ÷ 3 = 4190) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12570 ÷ 5 = 2514) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (12570 ÷ 6 = 2095) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | 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 | Yes (12570 ÷ 10 = 1257) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12570 a prime number?
No. 12570 = 2 × 3 × 5 × 419, so it is divisible by 2.
What are the factors of 12570?
1, 2, 3, 5, 6, 10, 15, 30, 419, 838, 1257, 2095, 2514, 4190, 6285, 12570.
What is 12570 in binary?
11000100011010 (hexadecimal 311A, octal 30432).
What is the square root of 12570?
About 112.1160.
Is 12570 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 12570?
12570 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.