The number 42570
42570 is a composite number with 48 divisors. Its prime factorisation is 2 × × 5 × 11 × 43. Divisors (48): 1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 30, 33, 43, 45, 55 … 42570.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 42570: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
42570 is composite. Its prime factorisation is
- 3
The divisors add up to 123552; without 42570 itself that is 80982, so 42570 is abundant (80982 is more than 42570). Euler's totient φ(42570) = 10080 numbers up to 42570 share no factor with it.
- 4
The digits of 42570 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42570 = 2 \times 3^{2} \times 5 \times 11 \times 43 \]42570 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 123552 |
| Euler totient φ(n) | 10080 |
| Square | 1812204900 |
| Cube | 77145562593000 |
| Square root | 206.324986 (= 3√4730) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.257 × |
42570 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand five hundred and seventy |
| Binary (base 2) | 1010011001001010 |
| Octal (base 8) | 123112 |
| Hexadecimal (base 16) | A64A |
| Base 3 | 2011101200 |
| As time | 42570 seconds = 11 h 49 min 30 s |
Is 42570 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42570 ÷ 2 = 21285) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (42570 ÷ 3 = 14190) | 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 (42570 ÷ 5 = 8514) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (42570 ÷ 6 = 7095) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (42570 ÷ 9 = 4730) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (42570 ÷ 10 = 4257) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (42570 ÷ 11 = 3870) | 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 42570 a prime number?
No. 42570 = 2 × × 5 × 11 × 43, so it is divisible by 2.
What are the factors of 42570?
1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 30, 33, 43, 45, 55, 66, 86, 90, 99, 110, 129, 165, 198, 215, 258, 330, 387, 430, 473, 495, 645, 774, 946, 990, 1290, 1419, 1935, 2365, 2838, 3870, 4257, 4730, 7095, 8514, 14190, 21285, 42570.
What is 42570 in binary?
1010011001001010 (hexadecimal A64A, octal 123112).
What is the square root of 42570?
About 206.3250, exactly 3√4730.
Is 42570 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 42570?
42570 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.