71 (number)
71 (seventy-one) is the natural number following 70 and preceding 72.
Look up seventy-one in Wiktionary, the free dictionary.
| ||||
---|---|---|---|---|
Cardinal | seventy-one | |||
Ordinal | 71st (seventy-first) | |||
Factorization | prime | |||
Prime | 20th | |||
Divisors | 1, 71 | |||
Greek numeral | ΟΑ´ | |||
Roman numeral | LXXI | |||
Binary | 10001112 | |||
Ternary | 21223 | |||
Senary | 1556 | |||
Octal | 1078 | |||
Duodecimal | 5B12 | |||
Hexadecimal | 4716 |
In mathematics
Because both rearrangements of its digits (17 and 71) are prime numbers, 71 is an emirp and more generally a permutable prime.[1][2] It is the largest number which occurs as a prime factor of an order of a sporadic simple group, the largest (15th) supersingular prime.[3][4]
It is a Pillai prime, since is divisible by 71, but 71 is not one more than a multiple of 9.[5] It is part of the last known pair (71, 7) of Brown numbers, since .[6]
See also
References
- Sloane, N. J. A. (ed.). "Sequence A006567 (Emirps (primes whose reversal is a different prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- Baker, Alan (January 2017). "Mathematical spandrels". Australasian Journal of Philosophy. 95 (4): 779–793. doi:10.1080/00048402.2016.1262881. S2CID 218623812.
- Sloane, N. J. A. (ed.). "Sequence A002267 (The 15 supersingular primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- Duncan, John F. R.; Ono, Ken (2016). "The Jack Daniels problem". Journal of Number Theory. 161: 230–239. doi:10.1016/j.jnt.2015.06.001. MR 3435726. S2CID 117748466.
- Sloane, N. J. A. (ed.). "Sequence A063980 (Pillai primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- Berndt, Bruce C.; Galway, William F. (2000). "On the Brocard–Ramanujan Diophantine equation ". Ramanujan Journal. 4 (1): 41–42. doi:10.1023/A:1009873805276. MR 1754629. S2CID 119711158.
- Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.