1103is an odd number,as it is not divisible by 2
The factors for 1103 are all the numbers between -1103 and 1103 , which divide 1103 without leaving any remainder. Since 1103 divided by -1103 is an integer, -1103 is a factor of 1103 .
Since 1103 divided by -1103 is a whole number, -1103 is a factor of 1103
Since 1103 divided by -1 is a whole number, -1 is a factor of 1103
Since 1103 divided by 1 is a whole number, 1 is a factor of 1103
Multiples of 1103 are all integers divisible by 1103 , i.e. the remainder of the full division by 1103 is zero. There are infinite multiples of 1103. The smallest multiples of 1103 are:
0 : in fact, 0 is divisible by any integer, so it is also a multiple of 1103 since 0 × 1103 = 0
1103 : in fact, 1103 is a multiple of itself, since 1103 is divisible by 1103 (it was 1103 / 1103 = 1, so the rest of this division is zero)
2206: in fact, 2206 = 1103 × 2
3309: in fact, 3309 = 1103 × 3
4412: in fact, 4412 = 1103 × 4
5515: in fact, 5515 = 1103 × 5
etc.
It is possible to determine using mathematical techniques whether an integer is prime or not.
for 1103, the answer is: yes, 1103 is a prime number because it only has two different divisors: 1 and itself (1103).
To know the primality of an integer, we can use several algorithms. The most naive is to try all divisors below the number you want to know if it is prime (in our case 1103). We can already eliminate even numbers bigger than 2 (then 4 , 6 , 8 ...). Besides, we can stop at the square root of the number in question (here 33.211 ). Historically, the Eratosthenes screen (which dates back to Antiquity) uses this technique relatively effectively.
More modern techniques include the Atkin screen, probabilistic tests, or the cyclotomic test.
Previous Numbers: ... 1101, 1102
Previous prime number: 1097
Next prime number: 1109