The number 41533
41533 is a composite number with 4 divisors. Its prime factorisation is 41 × 1013. Divisors (4): 1, 41, 1013, 41533.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41533: a semiprime: 41 × 1013, the product of two primes.
- 2
41533 is composite. Its prime factorisation is
- 3
The divisors add up to 42588; without 41533 itself that is 1055, so 41533 is deficient (1055 is less than 41533). Euler's totient φ(41533) = 40480 numbers up to 41533 share no factor with it.
- 4
The digits of 41533 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41533 = 41 \times 1013 \]
41533 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42588 |
| Euler totient φ(n) | 40480 |
| Square | 1724990089 |
| Cube | 71644013366437 |
| Square root | 203.796467 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.1533 × |
41533 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and thirty-three |
| Binary (base 2) | 1010001000111101 |
| Octal (base 8) | 121075 |
| Hexadecimal (base 16) | A23D |
| Base 3 | 2002222021 |
| As time | 41533 seconds = 11 h 32 min 13 s |
Is 41533 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41533 a prime number?
No. 41533 = 41 × 1013, so it is divisible by 41.
What are the factors of 41533?
1, 41, 1013, 41533.
What is 41533 in binary?
1010001000111101 (hexadecimal A23D, octal 121075).
What is the square root of 41533?
About 203.7965.
Is 41533 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 41533?
41533 is a semiprime: 41 × 1013, the product of two primes.