The number 573
573 is a composite number with 4 divisors. Its prime factorisation is 3 × 191. Divisors (4): 1, 3, 191, 573.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 573: a semiprime: 3 × 191, the product of two primes.
- 2
573 is composite. Its prime factorisation is
- 3
The divisors add up to 768; without 573 itself that is 195, so 573 is deficient (195 is less than 573). Euler's totient φ(573) = 380 numbers up to 573 share no factor with it.
- 4
The digits of 573 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 573 = 3 \times 191 \]
573 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 768 |
| Euler totient φ(n) | 380 |
| Square | 328329 |
| Cube | 188132517 |
| Square root | 23.937418 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 105 |
| Scientific notation | 5.73 × |
573 in other forms
| Form | Value |
|---|---|
| In words | five hundred and seventy-three |
| Roman numerals | DLXXIII |
| Binary (base 2) | 1000111101 |
| Octal (base 8) | 1075 |
| Hexadecimal (base 16) | 23D |
| Base 3 | 210020 |
| As time | 573 seconds = 9 min 33 s |
Is 573 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 | Yes (573 ÷ 3 = 191) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 573 a prime number?
No. 573 = 3 × 191, so it is divisible by 3.
What are the factors of 573?
1, 3, 191, 573.
What is 573 in binary?
1000111101 (hexadecimal 23D, octal 1075).
What is the square root of 573?
About 23.9374.
What is 573 in Roman numerals?
DLXXIII.
Is 573 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 573?
573 is a semiprime: 3 × 191, the product of two primes.