Named after | Circle |
---|---|
Publication year | 2004 |
Author of publication | Darling, D. J. |
No. of known terms | 27 |
First terms | 2, 3, 5, 7, 11, 13, 17, 37, 79, 113, 197, 199 |
Largest known term | (10^8177207-1)/9 |
OEIS index |
|
A circular prime is a prime number with the property that the number generated at each intermediate step when cyclically permuting its (base 10) digits will be prime. [1] [2] For example, 1193 is a circular prime, since 1931, 9311 and 3119 all are also prime. [3] A circular prime with at least two digits can only consist of combinations of the digits 1, 3, 7 or 9, because having 0, 2, 4, 6 or 8 as the last digit makes the number divisible by 2, and having 0 or 5 as the last digit makes it divisible by 5. [4] The complete listing of the smallest representative prime from all known cycles of circular primes (The single-digit primes and repunits are the only members of their respective cycles) is 2, 3, 5, 7, R2, 13, 17, 37, 79, 113, 197, 199, 337, 1193, 3779, 11939, 19937, 193939, 199933, R19, R23, R317, R1031, R49081, R86453, R109297, R270343, R5794777 and R8177207, where Rn is a repunit prime with n digits. There are no other circular primes up to 1023. [3] A type of prime related to the circular primes are the permutable primes, which are a subset of the circular primes (every permutable prime is also a circular prime, but not necessarily vice versa). [3]
The complete listing of the smallest representative prime from all known cycles of circular primes in base 12 is (using inverted two and three for ten and eleven, respectively)
where Rn is a repunit prime in base 12 with n digits. There are no other circular primes in base 12 up to 1212.
In base 2, only Mersenne primes can be circular primes, since any 0 permuted to the one's place results in an even number.
19 (nineteen) is the natural number following 18 and preceding 20. It is a prime number.
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 recreational mathematics, a repdigit or sometimes monodigit is a natural number composed of repeated instances of the same digit in a positional number system. The word is a portmanteau of "repeated" and "digit". Examples are 11, 666, 4444, and 999999. All repdigits are palindromic numbers and are multiples of repunits. Other well-known repdigits include the repunit primes and in particular the Mersenne primes.
In mathematics, a Riesel number is an odd natural number k for which is composite for all natural numbers n. In other words, when k is a Riesel number, all members of the following set are composite:
23 (twenty-three) is the natural number following 22 and preceding 24.
79 (seventy-nine) is the natural number following 78 and preceding 80.
73 (seventy-three) is the natural number following 72 and preceding 74. In English, it is the smallest natural number with twelve letters in its spelled out name.
31 (thirty-one) is the natural number following 30 and preceding 32. It is a prime number.
37 (thirty-seven) is the natural number following 36 and preceding 38.
A permutable prime, also known as anagrammatic prime, is a prime number which, in a given base, can have its digits' positions switched through any permutation and still be a prime number. H. E. Richert, who is supposedly the first to study these primes, called them permutable primes, but later they were also called absolute primes.
300 is the natural number following 299 and preceding 301.
In number theory, a Smith number is a composite number for which, in a given number base, the sum of its digits is equal to the sum of the digits in its prime factorization in the same base. In the case of numbers that are not square-free, the factorization is written without exponents, writing the repeated factor as many times as needed.
In mathematics, a harshad number in a given number base is an integer that is divisible by the sum of its digits when written in that base. Harshad numbers in base n are also known as n-harshad numbers. Harshad numbers were defined by D. R. Kaprekar, a mathematician from India. The word "harshad" comes from the Sanskrit harṣa (joy) + da (give), meaning joy-giver. The term "Niven number" arose from a paper delivered by Ivan M. Niven at a conference on number theory in 1977.
In number theory, a Wagstaff prime is a prime number of the form
A divisibility rule is a shorthand and useful way of determining whether a given integer is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix, or base, and they are all different, this article presents rules and examples only for decimal, or base 10, numbers. Martin Gardner explained and popularized these rules in his September 1962 "Mathematical Games" column in Scientific American.
1,000,000,000 is the natural number following 999,999,999 and preceding 1,000,000,001. With a number, "billion" can be abbreviated as b, bil or bn.
100,000 (one hundred thousand) is the natural number following 99,999 and preceding 100,001. In scientific notation, it is written as 105.
In mathematics, a pandigital number is an integer that in a given base has among its significant digits each digit used in the base at least once. For example, 1234567890 is a pandigital number in base 10.
271 is the natural number after 270 and before 272.