The number 1269
1269 is a composite number with 8 divisors. Its prime factorisation is × 47. Divisors (8): 1, 3, 9, 27, 47, 141, 423, 1269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1269 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1269 is composite. Its prime factorisation is
- 3
The divisors add up to 1920; without 1269 itself that is 651, so 1269 is deficient (651 is less than 1269). Euler's totient φ(1269) = 828 numbers up to 1269 share no factor with it.
- 4
The digits of 1269 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1269 = 3^{3} \times 47 \]1269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1920 |
| Euler totient φ(n) | 828 |
| Square | 1610361 |
| Cube | 2043548109 |
| Square root | 35.623026 (= 3√141) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 39 |
| Scientific notation | 1.269 × |
1269 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and sixty-nine |
| Roman numerals | MCCLXIX |
| Binary (base 2) | 10011110101 |
| Octal (base 8) | 2365 |
| Hexadecimal (base 16) | 4F5 |
| Base 3 | 1202000 |
| As time | 1269 seconds = 21 min 9 s |
Is 1269 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 (1269 ÷ 3 = 423) | 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 4) | 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 2) | 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 | Yes (1269 ÷ 9 = 141) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 1269 a prime number?
No. 1269 = × 47, so it is divisible by 3.
What are the factors of 1269?
1, 3, 9, 27, 47, 141, 423, 1269.
What is 1269 in binary?
10011110101 (hexadecimal 4F5, octal 2365).
What is the square root of 1269?
About 35.6230, exactly 3√141.
What is 1269 in Roman numerals?
MCCLXIX.
Is 1269 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 1269?
It is a composite number with 8 divisors.