1161 is both a natural number that follows 1160 and precedes 1162, and a year in the 12th century often written MCLXI in Roman numerals. As a topic it can be treated as an arithmetic object with distinctive divisibility and representation properties, and as a historical date with connections to events of the medieval period.

Mathematical properties

In arithmetic, 1161 is a composite integer. Its prime factorization is 33 × 43, so 1161 = 27 × 43. The full set of positive divisors is 1, 3, 9, 27, 43, 129, 387 and 1161. The sum of all divisors (the sigma function) equals 1760, so the sum of proper divisors is 599; because 599 < 1161, the number is classified as deficient rather than perfect or abundant.

Representations and simple facts

Common numeric representations include the Roman numeral MCLXI and the hexadecimal value 0x489. In binary it is written 10010001001, a sequence that happens to read the same forwards and backwards and is therefore a binary palindrome. The decimal digit sum is 1+1+6+1 = 9, which explains divisibility by 9 and by 3 (indeed by 33). 1161 is neither a perfect square nor a triangular number.

Year 1161 (AD)

Viewed as a calendar year in the Julian system, 1161 falls in the middle of the 12th century. That period was marked by dynastic and military struggles across Eurasia. One well-documented confrontation of the era was a naval engagement in China during the Jin–Song conflicts; the broader century also saw the crusader states and European principalities contending for influence. Notable individuals associated with 1161 include rulers and nobles whose births or actions later shaped regional histories.

When people encounter 1161 today it may appear as an identifier — for example, model numbers, catalogue entries, or dated inscriptions — rather than as a quantity with special practical significance. The number’s simple factorization and palindromic binary form make it of occasional interest in recreational number theory and in demonstrations of numeral-base behavior.

Notable distinctions:

  • Prime factorization: 33 × 43.
  • Proper divisor sum: 599 (deficient number).
  • Binary form 10010001001 is palindromic.
  • Roman numeral: MCLXI; hexadecimal: 0x489.