The number 1573
1573 is a composite number with 6 divisors. Its prime factorisation is Ć 13. Divisors (6): 1, 11, 13, 121, 143, 1573.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1573 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1573 is composite. Its prime factorisation is
- 3
The divisors add up to 1862; without 1573 itself that is 289, so 1573 is deficient (289 is less than 1573). Euler's totient Ļ(1573) = 1320 numbers up to 1573 share no factor with it.
- 4
The digits of 1573 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1573 = 11^{2} \times 13 \]1573 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 1862 |
| Euler totient Ļ(n) | 1320 |
| Square | 2474329 |
| Cube | 3892119517 |
| Square root | 39.661064 (= 11ā13) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.573 Ć |
1573 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and seventy-three |
| Roman numerals | MDLXXIII |
| Binary (base 2) | 11000100101 |
| Octal (base 8) | 3045 |
| Hexadecimal (base 16) | 625 |
| Base 3 | 2011021 |
| As time | 1573 seconds = 26 min 13 s |
Is 1573 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 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 | Yes (1573 Ć· 11 = 143) | 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 1573 a prime number?
No. 1573 = Ć 13, so it is divisible by 11.
What are the factors of 1573?
1, 11, 13, 121, 143, 1573.
What is 1573 in binary?
11000100101 (hexadecimal 625, octal 3045).
What is the square root of 1573?
About 39.6611, exactly 11ā13.
What is 1573 in Roman numerals?
MDLXXIII.
Is 1573 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 1573?
It is a composite number with 6 divisors.