The number 41190
41190 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1373. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1373, 2746, 4119, 6865, 8238, 13730, 20595, 41190.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41190: a Harshad number: divisible by its digit sum 15.
- 2
41190 is composite. Its prime factorisation is
- 3
The divisors add up to 98928; without 41190 itself that is 57738, so 41190 is abundant (57738 is more than 41190). Euler's totient φ(41190) = 10976 numbers up to 41190 share no factor with it.
- 4
The digits of 41190 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41190 = 2 \times 3 \times 5 \times 1373 \]
41190 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 98928 |
| Euler totient φ(n) | 10976 |
| Square | 1696616100 |
| Cube | 69883617159000 |
| Square root | 202.953197 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.119 × |
41190 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand one hundred and ninety |
| Binary (base 2) | 1010000011100110 |
| Octal (base 8) | 120346 |
| Hexadecimal (base 16) | A0E6 |
| Base 3 | 2002111120 |
| As time | 41190 seconds = 11 h 26 min 30 s |
Is 41190 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (41190 ÷ 2 = 20595) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (41190 ÷ 3 = 13730) | 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 (41190 ÷ 5 = 8238) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (41190 ÷ 6 = 6865) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (41190 ÷ 10 = 4119) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 41190 a prime number?
No. 41190 = 2 × 3 × 5 × 1373, so it is divisible by 2.
What are the factors of 41190?
1, 2, 3, 5, 6, 10, 15, 30, 1373, 2746, 4119, 6865, 8238, 13730, 20595, 41190.
What is 41190 in binary?
1010000011100110 (hexadecimal A0E6, octal 120346).
What is the square root of 41190?
About 202.9532.
Is 41190 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 41190?
41190 is a Harshad number: divisible by its digit sum 15.