The number 1272
1272 is a composite number with 16 divisors. Its prime factorisation is × 3 × 53. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 53, 106, 159, 212, 318, 424, 636, 1272.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1272: a Harshad number: divisible by its digit sum 12.
- 2
1272 is composite. Its prime factorisation is
- 3
The divisors add up to 3240; without 1272 itself that is 1968, so 1272 is abundant (1968 is more than 1272). Euler's totient φ(1272) = 416 numbers up to 1272 share no factor with it.
- 4
The digits of 1272 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1272 = 2^{3} \times 3 \times 53 \]1272 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 3240 |
| Euler totient φ(n) | 416 |
| Square | 1617984 |
| Cube | 2058075648 |
| Square root | 35.665109 (= 2√318) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 57 |
| Scientific notation | 1.272 × |
1272 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and seventy-two |
| Roman numerals | MCCLXXII |
| Binary (base 2) | 10011111000 |
| Octal (base 8) | 2370 |
| Hexadecimal (base 16) | 4F8 |
| Base 3 | 1202010 |
| As time | 1272 seconds = 21 min 12 s |
Is 1272 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1272 ÷ 2 = 636) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1272 ÷ 3 = 424) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1272 ÷ 4 = 318) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (1272 ÷ 6 = 212) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (1272 ÷ 8 = 159) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (1272 ÷ 12 = 106) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1272 a prime number?
No. 1272 = × 3 × 53, so it is divisible by 2.
What are the factors of 1272?
1, 2, 3, 4, 6, 8, 12, 24, 53, 106, 159, 212, 318, 424, 636, 1272.
What is 1272 in binary?
10011111000 (hexadecimal 4F8, octal 2370).
What is the square root of 1272?
About 35.6651, exactly 2√318.
What is 1272 in Roman numerals?
MCCLXXII.
Is 1272 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1272?
1272 is a Harshad number: divisible by its digit sum 12.