The number 41522
41522 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 1597. Divisors (8): 1, 2, 13, 26, 1597, 3194, 20761, 41522.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
41522 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
41522 is composite. Its prime factorisation is
- 3
The divisors add up to 67116; without 41522 itself that is 25594, so 41522 is deficient (25594 is less than 41522). Euler's totient φ(41522) = 19152 numbers up to 41522 share no factor with it.
- 4
The digits of 41522 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 225 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41522 = 2 \times 13 \times 1597 \]
41522 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67116 |
| Euler totient φ(n) | 19152 |
| Square | 1724076484 |
| Cube | 71587103768648 |
| Square root | 203.769478 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 225 |
| Scientific notation | 4.1522 × |
41522 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and twenty-two |
| Binary (base 2) | 1010001000110010 |
| Octal (base 8) | 121062 |
| Hexadecimal (base 16) | A232 |
| Base 3 | 2002221212 |
| As time | 41522 seconds = 11 h 32 min 2 s |
Is 41522 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (41522 ÷ 2 = 20761) | 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 | No (remainder 2) | 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 5) | 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 | No (remainder 5) | 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 8) | 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 41522 a prime number?
No. 41522 = 2 × 13 × 1597, so it is divisible by 2.
What are the factors of 41522?
1, 2, 13, 26, 1597, 3194, 20761, 41522.
What is 41522 in binary?
1010001000110010 (hexadecimal A232, octal 121062).
What is the square root of 41522?
About 203.7695.
Is 41522 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 41522?
It is a composite number with 8 divisors.