Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

127 (number)

From Wikipedia, the free encyclopedia
Natural number
← 126127 128 →
Cardinalone hundred twenty-seven
Ordinal127th
(one hundred twenty-seventh)
Factorizationprime
Prime31st
Divisors1, 127
Greek numeralΡΚΖ´
Roman numeralCXXVII,cxxvii
Binary11111112
Ternary112013
Senary3316
Octal1778
DuodecimalA712
Hexadecimal7F16

127 (one hundred [and] twenty-seven) is thenatural number following126 and preceding128. It is also a prime number.

In mathematics

[edit]
127 as a centered hexagonal number

In other fields

[edit]
  • The non-printable "Delete" (DEL) control character inASCII.
  • Linotype (and Intertype) machines used brass matrices with one of 127 possible combinations punched into the top to enable the matrices to return to their proper channel in the magazine.

References

[edit]
  1. ^"Sloane's A002407 : Cuban primes".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-27.
  2. ^Sloane, N. J. A. (ed.)."Sequence A109611 (Chen primes: primes p such that p + 2 is either a prime or a semiprime.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^"Sloane's A051634 : Strong primes".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-27.
  4. ^"Sloane's A003215 : Hex (or centered hexagonal) numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-27.
  5. ^"Sloane's A001006 : Motzkin numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-27.
  6. ^Sloane, N. J. A. (ed.)."Sequence A024916 (sum_{k=1..n} sigma(k) where sigma(n) = sum of divisors of n)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  7. ^Sloane, N. J. A. (ed.)."Sequence A071148".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.. Partial sums of a sequence of odd primes; a(n) = sum of the first n odd primes.
  8. ^Sloane, N. J. A. (ed.)."Sequence A006285 (Odd numbers not of form p + 2^x (de Polignac numbers))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ^Sloane, N. J. A. (ed.)."Sequence A137985".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.. Complementing any single bit in the binary representation of these primes produces a composite number.
  10. ^Sloane, N. J. A. (ed.)."Sequence A065577 (Number of Goldbach partitions of 10^n)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2023-08-31.
  11. ^Sloane, N. J. A. (ed.)."Sequence A013629".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.. Floor of imaginary parts of nontrivial zeros of Riemann zeta function.
  12. ^Sloane, N. J. A. (ed.)."Sequence A000959".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.. Lucky numbers
  13. ^Sloane, N. J. A. (ed.)."Sequence A099243".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.. A variation on Flavius's sieve.
  14. ^Sloane, N. J. A. (ed.)."Sequence A005235".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.. Fortunate numbers: least m > 1 such that m + prime(n)# is prime, where p# denotes the product of all primes <= p.
0 to 199
200 to 399
400 to 999
1000s and 10,000s
1000s
10,000s
100,000s to 10,000,000,000,000s
Retrieved from "https://en.wikipedia.org/w/index.php?title=127_(number)&oldid=1320711196"
Category:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp