The number 40590
40590 is a composite number with 48 divisors. Its prime factorisation is 2 × × 5 × 11 × 41. Divisors (48): 1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 30, 33, 41, 45, 55 … 40590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40590: a Harshad number: divisible by its digit sum 18.
- 2
40590 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 40590 itself that is 77346, so 40590 is abundant (77346 is more than 40590). Euler's totient φ(40590) = 9600 numbers up to 40590 share no factor with it.
- 4
The digits of 40590 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40590 = 2 \times 3^{2} \times 5 \times 11 \times 41 \]40590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 9600 |
| Square | 1647548100 |
| Cube | 66873977379000 |
| Square root | 201.469601 (= 3√4510) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.059 × |
40590 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and ninety |
| Binary (base 2) | 1001111010001110 |
| Octal (base 8) | 117216 |
| Hexadecimal (base 16) | 9E8E |
| Base 3 | 2001200100 |
| As time | 40590 seconds = 11 h 16 min 30 s |
Is 40590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40590 ÷ 2 = 20295) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (40590 ÷ 3 = 13530) | 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 (40590 ÷ 5 = 8118) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (40590 ÷ 6 = 6765) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (40590 ÷ 9 = 4510) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (40590 ÷ 10 = 4059) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (40590 ÷ 11 = 3690) | 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 40590 a prime number?
No. 40590 = 2 × × 5 × 11 × 41, so it is divisible by 2.
What are the factors of 40590?
1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 30, 33, 41, 45, 55, 66, 82, 90, 99, 110, 123, 165, 198, 205, 246, 330, 369, 410, 451, 495, 615, 738, 902, 990, 1230, 1353, 1845, 2255, 2706, 3690, 4059, 4510, 6765, 8118, 13530, 20295, 40590.
What is 40590 in binary?
1001111010001110 (hexadecimal 9E8E, octal 117216).
What is the square root of 40590?
About 201.4696, exactly 3√4510.
Is 40590 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 40590?
40590 is a Harshad number: divisible by its digit sum 18.