The number 1270
1270 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 127. Divisors (8): 1, 2, 5, 10, 127, 254, 635, 1270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1270: a Harshad number: divisible by its digit sum 10.
- 2
1270 is composite. Its prime factorisation is
- 3
The divisors add up to 2304; without 1270 itself that is 1034, so 1270 is deficient (1034 is less than 1270). Euler's totient φ(1270) = 504 numbers up to 1270 share no factor with it.
- 4
The digits of 1270 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1270 = 2 \times 5 \times 127 \]
1270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2304 |
| Euler totient φ(n) | 504 |
| Square | 1612900 |
| Cube | 2048383000 |
| Square root | 35.637059 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.27 × |
1270 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and seventy |
| Roman numerals | MCCLXX |
| Binary (base 2) | 10011110110 |
| Octal (base 8) | 2366 |
| Hexadecimal (base 16) | 4F6 |
| Base 3 | 1202001 |
| As time | 1270 seconds = 21 min 10 s |
Is 1270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1270 ÷ 2 = 635) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1270 ÷ 5 = 254) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1270 ÷ 10 = 127) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1270 a prime number?
No. 1270 = 2 × 5 × 127, so it is divisible by 2.
What are the factors of 1270?
1, 2, 5, 10, 127, 254, 635, 1270.
What is 1270 in binary?
10011110110 (hexadecimal 4F6, octal 2366).
What is the square root of 1270?
About 35.6371.
What is 1270 in Roman numerals?
MCCLXX.
Is 1270 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 1270?
1270 is a Harshad number: divisible by its digit sum 10.