The number 41053
41053 is a composite number with 4 divisors. Its prime factorisation is 61 × 673. Divisors (4): 1, 61, 673, 41053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41053: a semiprime: 61 × 673, the product of two primes.
- 2
41053 is composite. Its prime factorisation is
- 3
The divisors add up to 41788; without 41053 itself that is 735, so 41053 is deficient (735 is less than 41053). Euler's totient φ(41053) = 40320 numbers up to 41053 share no factor with it.
- 4
The digits of 41053 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41053 = 61 \times 673 \]
41053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 41788 |
| Euler totient φ(n) | 40320 |
| Square | 1685348809 |
| Cube | 69188624655877 |
| Square root | 202.615399 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.1053 × |
41053 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand and fifty-three |
| Binary (base 2) | 1010000001011101 |
| Octal (base 8) | 120135 |
| Hexadecimal (base 16) | A05D |
| Base 3 | 2002022111 |
| As time | 41053 seconds = 11 h 24 min 13 s |
Is 41053 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 1) | 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 41053 a prime number?
No. 41053 = 61 × 673, so it is divisible by 61.
What are the factors of 41053?
1, 61, 673, 41053.
What is 41053 in binary?
1010000001011101 (hexadecimal A05D, octal 120135).
What is the square root of 41053?
About 202.6154.
Is 41053 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 41053?
41053 is a semiprime: 61 × 673, the product of two primes.