The number 1431
1431 is a triangular number: 1 + 2 + … + 53 = 1431. Its prime factorisation is × 53. Divisors (8): 1, 3, 9, 27, 53, 159, 477, 1431.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1431: a triangular number: 1 + 2 + … + 53 = 1431; a Harshad number: divisible by its digit sum 9.
- 2
1431 is composite. Its prime factorisation is
- 3
The divisors add up to 2160; without 1431 itself that is 729, so 1431 is deficient (729 is less than 1431). Euler's totient φ(1431) = 936 numbers up to 1431 share no factor with it.
- 4
The digits of 1431 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1431 = 3^{3} \times 53 \]1431 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2160 |
| Euler totient φ(n) | 936 |
| Square | 2047761 |
| Cube | 2930345991 |
| Square root | 37.828561 (= 3√159) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 26 |
| Scientific notation | 1.431 × |
1431 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and thirty-one |
| Roman numerals | MCDXXXI |
| Binary (base 2) | 10110010111 |
| Octal (base 8) | 2627 |
| Hexadecimal (base 16) | 597 |
| Base 3 | 1222000 |
| As time | 1431 seconds = 23 min 51 s |
Is 1431 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 (1431 ÷ 3 = 477) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (1431 ÷ 9 = 159) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1431 a prime number?
No. 1431 = × 53, so it is divisible by 3.
What are the factors of 1431?
1, 3, 9, 27, 53, 159, 477, 1431.
What is 1431 in binary?
10110010111 (hexadecimal 597, octal 2627).
What is the square root of 1431?
About 37.8286, exactly 3√159.
What is 1431 in Roman numerals?
MCDXXXI.
Is 1431 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 1431?
1431 is a triangular number: 1 + 2 + … + 53 = 1431; a Harshad number: divisible by its digit sum 9.