The number 1571
1571 is the 248th prime number and a binary palindrome (11000100011). Its only divisors are 1 and 1571.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1571: the 248th prime number; a binary palindrome (11000100011).
- 2
1571 is prime, so its only factors are 1 and 1571. It is the 248th prime; the next prime is 1579 and the one before is 1567.
- 3
The divisors add up to 1572; without 1571 itself that is 1, so 1571 is deficient (1 is less than 1571). Euler's totient φ(1571) = 1570 numbers up to 1571 share no factor with it.
- 4
The digits of 1571 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
1571 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 1572 |
| Euler totient φ(n) | 1570 |
| Square | 2468041 |
| Cube | 3877292411 |
| Square root | 39.635842 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.571 × |
1571 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and seventy-one |
| Roman numerals | MDLXXI |
| Binary (base 2) | 11000100011 |
| Octal (base 8) | 3043 |
| Hexadecimal (base 16) | 623 |
| Base 3 | 2011012 |
| As time | 1571 seconds = 26 min 11 s |
Is 1571 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1571 a prime number?
Yes. 1571 is divisible only by 1 and itself.
What are the factors of 1571?
1, 1571.
What is 1571 in binary?
11000100011 (hexadecimal 623, octal 3043).
What is the square root of 1571?
About 39.6358.
What is 1571 in Roman numerals?
MDLXXI.
Is 1571 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1571?
1571 is the 248th prime number; a binary palindrome (11000100011).