1121 (integer)

An overview of the integer 1121: its factorization, arithmetic properties, representations, brief notes on the years 1121 AD/BC, and a few notable mathematical facts.

1121 is the natural number following 1120 and preceding 1122. In elementary arithmetic it is an odd composite integer with a simple prime factorization and several elementary number‑theoretic properties that make it a useful example in discussions of semiprimes and modular arithmetic.

Mathematical properties

The complete prime factorization of 1121 is 19 × 59, where both 19 and 59 are prime numbers. Because it is the product of two distinct primes, 1121 is a semiprime and squarefree. The number of positive divisors is four: 1, 19, 59 and 1121; their sum is 1,200 and the sum of proper divisors (the aliquot sum) is 79.

Arithmetic invariants and consequences

Euler's totient function: φ(1121) = 1121 × (1 − 1/19) × (1 − 1/59) = 1,044.
Because both prime factors are congruent to 3 mod 4 (19 ≡ 3, 59 ≡ 3), 1121 cannot be expressed as a sum of two integer squares and qualifies as a Blum integer (product of two distinct primes each ≡ 3 mod 4).
1121 is not triangular, not a perfect power, and is squarefree.

Representations

In common positional systems 1121 is written as "1121" in base 10. In binary it is 10001100001, and in hexadecimal it is 0x461. These alternative representations are useful in computer science and digital arithmetic when examining bit patterns, parity, or modular relationships.

Years labelled 1121

The numeral also appears as a year designation. The year 1121 AD falls in the early 12th century and is part of the High Middle Ages; 1121 BC is a date in the late Bronze Age. Specific events associated with those years depend on regional chronologies and historical sources. When the number 1121 is used to label a year, it serves simply as the ordinal count of years in the proleptic or standard era in use.

Notable facts and applications

As a semiprime and a Blum integer, 1121 is a straightforward example in elementary discussions of factorization, multiplicative functions (like φ), and cryptographic concepts that reference products of special primes. Its small divisor set and tidy arithmetical invariants make it convenient for exercises in number theory, modular arithmetic, and teaching examples.