The number 1471
1471 is the 233rd prime number. Its only divisors are 1 and 1471.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1471: the 233rd prime number.
- 2
1471 is prime, so its only factors are 1 and 1471. It is the 233rd prime; the next prime is 1481 and the one before is 1459.
- 3
The divisors add up to 1472; without 1471 itself that is 1, so 1471 is deficient (1 is less than 1471). Euler's totient φ(1471) = 1470 numbers up to 1471 share no factor with it.
- 4
The digits of 1471 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
1471 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 1472 |
| Euler totient φ(n) | 1470 |
| Square | 2163841 |
| Cube | 3183010111 |
| Square root | 38.353618 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 171 |
| Scientific notation | 1.471 × |
1471 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and seventy-one |
| Roman numerals | MCDLXXI |
| Binary (base 2) | 10110111111 |
| Octal (base 8) | 2677 |
| Hexadecimal (base 16) | 5BF |
| Base 3 | 2000111 |
| As time | 1471 seconds = 24 min 31 s |
Is 1471 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1471 a prime number?
Yes. 1471 is divisible only by 1 and itself.
What are the factors of 1471?
1, 1471.
What is 1471 in binary?
10110111111 (hexadecimal 5BF, octal 2677).
What is the square root of 1471?
About 38.3536.
What is 1471 in Roman numerals?
MCDLXXI.
Is 1471 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1471?
1471 is the 233rd prime number.