The number 42590
42590 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 4259. Divisors (8): 1, 2, 5, 10, 4259, 8518, 21295, 42590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42590 is composite. Its prime factorisation is
- 3
The divisors add up to 76680; without 42590 itself that is 34090, so 42590 is deficient (34090 is less than 42590). Euler's totient φ(42590) = 17032 numbers up to 42590 share no factor with it.
- 4
The digits of 42590 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42590 = 2 \times 5 \times 4259 \]
42590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76680 |
| Euler totient φ(n) | 17032 |
| Square | 1813908100 |
| Cube | 77254345979000 |
| Square root | 206.373448 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.259 × |
42590 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand five hundred and ninety |
| Binary (base 2) | 1010011001011110 |
| Octal (base 8) | 123136 |
| Hexadecimal (base 16) | A65E |
| Base 3 | 2011102102 |
| As time | 42590 seconds = 11 h 49 min 50 s |
Is 42590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42590 ÷ 2 = 21295) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (42590 ÷ 5 = 8518) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (42590 ÷ 10 = 4259) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42590 a prime number?
No. 42590 = 2 × 5 × 4259, so it is divisible by 2.
What are the factors of 42590?
1, 2, 5, 10, 4259, 8518, 21295, 42590.
What is 42590 in binary?
1010011001011110 (hexadecimal A65E, octal 123136).
What is the square root of 42590?
About 206.3734.
Is 42590 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 42590?
It is a composite number with 8 divisors.