1093 (number)

Last updated
109210931094
Cardinal one thousand ninety-three
Ordinal 1093rd
(one thousand ninety-third)
Factorization prime
Prime yes
Divisors 1, 1093
Greek numeral ,ΑϞΓ´
Roman numeral MXCIII
Binary 100010001012
Ternary 11111113
Senary 50216
Octal 21058
Duodecimal 77112
Hexadecimal 44516

1093 is the natural number following 1092 and preceding 1094.

1093 is a prime number. Together with 1091 and 1097, it forms a prime triplet. It is a happy prime and a star prime. It is also the smallest Wieferich prime. 1093 is a repunit prime in base 3 because:

Related Research Articles

<span class="mw-page-title-main">Least common multiple</span> Smallest positive number divisible by two integers

In arithmetic and number theory, the least common multiple, lowest common multiple, or smallest common multiple of two integers a and b, usually denoted by lcm(ab), is the smallest positive integer that is divisible by both a and b. Since division of integers by zero is undefined, this definition has meaning only if a and b are both different from zero. However, some authors define lcm(a, 0) as 0 for all a, since 0 is the only common multiple of a and 0.

In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2n − 1 for some integer n. They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If n is a composite number then so is 2n − 1. Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form Mp = 2p − 1 for some prime p.

<span class="mw-page-title-main">Prime number</span> Number divisible only by 1 or itself

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

<span class="mw-page-title-main">Perfect number</span> Integer equal to the sum of its proper divisors

In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself. For instance, 6 has proper divisors 1, 2 and 3, and 1 + 2 + 3 = 6, so 6 is a perfect number. The next perfect number is 28, since 1 + 2 + 4 + 7 + 14 = 28.

<span class="mw-page-title-main">Divisor</span> Integer that is a factor of another integer

In mathematics, a divisor of an integer also called a factor of is an integer that may be multiplied by some integer to produce In this case, one also says that is a multiple of An integer is divisible or evenly divisible by another integer if is a divisor of ; this implies dividing by leaves no remainder.

In number theory, a prime number p is a Sophie Germain prime if 2p + 1 is also prime. The number 2p + 1 associated with a Sophie Germain prime is called a safe prime. For example, 11 is a Sophie Germain prime and 2 × 11 + 1 = 23 is its associated safe prime. Sophie Germain primes and safe primes have applications in public key cryptography and primality testing. It has been conjectured that there are infinitely many Sophie Germain primes, but this remains unproven.

A highly composite number is a positive integer that has more divisors than all smaller positive integers. A related concept is that of a largely composite number, a positive integer that has at least as many divisors as all smaller positive integers. The name can be somewhat misleading, as the first two highly composite numbers are not actually composite numbers; however, all further terms are.

In recreational mathematics, a repunit is a number like 11, 111, or 1111 that contains only the digit 1 — a more specific type of repdigit. The term stands for "repeated unit" and was coined in 1966 by Albert H. Beiler in his book Recreations in the Theory of Numbers.

In number theory, a Wieferich prime is a prime number p such that p2 divides 2p − 1 − 1, therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides 2p − 1 − 1. Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's Last Theorem, at which time both of Fermat's theorems were already well known to mathematicians.

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist, although none are known.

32 (thirty-two) is the natural number following 31 and preceding 33.

In mathematics, a palindromic prime is a prime number that is also a palindromic number. Palindromicity depends on the base of the number system and its notational conventions, while primality is independent of such concerns. The first few decimal palindromic primes are:

1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it can be written with or without a comma or sometimes a period separating the thousands digit: 1,000.

239 is the natural number following 238 and preceding 240.

<span class="mw-page-title-main">Prime gap</span> Difference between two successive prime numbers

A prime gap is the difference between two successive prime numbers. The n-th prime gap, denoted gn or g(pn) is the difference between the (n + 1)-st and the n-th prime numbers, i.e.

<span class="mw-page-title-main">Landau's problems</span> Four basic unsolved problems about prime numbers

At the 1912 International Congress of Mathematicians, Edmund Landau listed four basic problems about prime numbers. These problems were characterised in his speech as "unattackable at the present state of mathematics" and are now known as Landau's problems. They are as follows:

  1. Goldbach's conjecture: Can every even integer greater than 2 be written as the sum of two primes?
  2. Twin prime conjecture: Are there infinitely many primes p such that p + 2 is prime?
  3. Legendre's conjecture: Does there always exist at least one prime between consecutive perfect squares?
  4. Are there infinitely many primes p such that p − 1 is a perfect square? In other words: Are there infinitely many primes of the form n2 + 1?
<span class="mw-page-title-main">Wladimir Kaminer</span> German writer

Wladimir Kaminer is a Russian-born German short story writer, columnist and disc jockey of Jewish origin, the son of Viktor and Shanna Kaminer.

<span class="mw-page-title-main">Heine Meine</span> American baseball player (1896-1968)

Henry William "Heine" Meine, sometimes "Heinie" Meine, was a professional baseball player. Meine was a right-handed pitcher who played for the St. Louis Browns in 1922 and for the Pittsburgh Pirates from 1929 to 1934. He was given the nickname "The Count of Luxemburg" on account of his operating a speakeasy/tavern in the Luxemburg section of St. Louis. He led the National League in wins and innings pitched in 1931 and compiled a 66–50 record in seven seasons of Major League Baseball.

A repeating decimal or recurring decimal is a decimal representation of a number whose digits are eventually periodic ; if this sequence consists only of zeros, the decimal is said to be terminating, and is not considered as repeating.

References