# Divisors of 473

## Divisors of 473

The list of all positive divisors (that is, the list of all integers that divide 22) is as follows :

Accordingly:

473 is multiplo of 1

473 is multiplo of 11

473 is multiplo of 43

473 has 3 positive divisors

## Parity of 473

473is an odd number,as it is not divisible by 2

## The factors for 473

The factors for 473 are all the numbers between -473 and 473 , which divide 473 without leaving any remainder. Since 473 divided by -473 is an integer, -473 is a factor of 473 .

Since 473 divided by -473 is a whole number, -473 is a factor of 473

Since 473 divided by -43 is a whole number, -43 is a factor of 473

Since 473 divided by -11 is a whole number, -11 is a factor of 473

Since 473 divided by -1 is a whole number, -1 is a factor of 473

Since 473 divided by 1 is a whole number, 1 is a factor of 473

Since 473 divided by 11 is a whole number, 11 is a factor of 473

Since 473 divided by 43 is a whole number, 43 is a factor of 473

## What are the multiples of 473?

Multiples of 473 are all integers divisible by 473 , i.e. the remainder of the full division by 473 is zero. There are infinite multiples of 473. The smallest multiples of 473 are:

0 : in fact, 0 is divisible by any integer, so it is also a multiple of 473 since 0 × 473 = 0

473 : in fact, 473 is a multiple of itself, since 473 is divisible by 473 (it was 473 / 473 = 1, so the rest of this division is zero)

946: in fact, 946 = 473 × 2

1419: in fact, 1419 = 473 × 3

1892: in fact, 1892 = 473 × 4

2365: in fact, 2365 = 473 × 5

etc.

## Is 473 a prime number?

It is possible to determine using mathematical techniques whether an integer is prime or not.

for 473, the answer is: No, 473 is not a prime number.

## How do you determine if a number is prime?

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 473). 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 21.749 ). 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.