The number 41262
41262 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × 13 × . Divisors (24): 1, 2, 3, 6, 13, 23, 26, 39, 46, 69, 78, 138, 299, 529, 598, 897 … 41262.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
41262 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
41262 is composite. Its prime factorisation is
- 3
The divisors add up to 92904; without 41262 itself that is 51642, so 41262 is abundant (51642 is more than 41262). Euler's totient φ(41262) = 12144 numbers up to 41262 share no factor with it.
- 4
The digits of 41262 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 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41262 = 2 \times 3 \times 13 \times 23^{2} \]41262 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 92904 |
| Euler totient φ(n) | 12144 |
| Square | 1702552644 |
| Cube | 70250727196728 |
| Square root | 203.130500 (= 23√78) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 31 |
| Scientific notation | 4.1262 × |
41262 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand two hundred and sixty-two |
| Binary (base 2) | 1010000100101110 |
| Octal (base 8) | 120456 |
| Hexadecimal (base 16) | A12E |
| Base 3 | 2002121020 |
| As time | 41262 seconds = 11 h 27 min 42 s |
Is 41262 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (41262 ÷ 2 = 20631) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (41262 ÷ 3 = 13754) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (41262 ÷ 6 = 6877) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 41262 a prime number?
No. 41262 = 2 × 3 × 13 × , so it is divisible by 2.
What are the factors of 41262?
1, 2, 3, 6, 13, 23, 26, 39, 46, 69, 78, 138, 299, 529, 598, 897, 1058, 1587, 1794, 3174, 6877, 13754, 20631, 41262.
What is 41262 in binary?
1010000100101110 (hexadecimal A12E, octal 120456).
What is the square root of 41262?
About 203.1305, exactly 23√78.
Is 41262 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 41262?
It is a composite number with 24 divisors.