Jump to content

167 (number)

From Wikipedia, the free encyclopedia
← 166 167 168 →
Cardinalone hundred sixty-seven
Ordinal167th
(one hundred sixty-seventh)
Factorizationprime
Prime39th, chen, gaussian, safe
Divisors1, 167
Greek numeralΡΞΖ´
Roman numeralCLXVII
Binary101001112
Ternary200123
Senary4356
Octal2478
Duodecimal11B12
HexadecimalA716

167 (one hundred [and] sixty-seven) is the natural number following 166 and preceding 168.

In mathematics

[edit]

167 is the 39th prime number, an emirp, an isolated prime, a Chen prime,[1] a Gaussian prime, a safe prime,[2] and an Eisenstein prime with no imaginary part and a real part of the form .

167 is the smallest number which requires six terms when expressed using the greedy algorithm as a sum of squares, 167 = 144 + 16 + 4 + 1 + 1 + 1,[3] although by Lagrange's four-square theorem its non-greedy expression as a sum of squares can be shorter, e.g. 167 = 121 + 36 + 9 + 1.

167 is a full reptend prime in base 10, since the decimal expansion of 1/167 repeats the following 166 digits: 0.00598802395209580838323353293413173652694610778443113772455089820359281437125748502994 0119760479041916167664670658682634730538922155688622754491017964071856287425149700...

167 is a highly cototient number, as it is the smallest number k with exactly 15 solutions to the equation x - φ(x) = k. It is also a strictly non-palindromic number.

167 is the smallest multi-digit prime such that the product of digits is equal to the number of digits times the sum of the digits, i. e., 1×6×7 = 3×(1+6+7)

167 is the smallest positive integer d such that the imaginary quadratic field Q(d) has class number = 11.[4]

In astronomy

[edit]

In the military

[edit]

In sports

[edit]

In transportation

[edit]

In other fields

[edit]

167 is also:

See also

[edit]
[edit]

References

[edit]
  1. ^ Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes: primes p such that p + 2 is either a prime or a semiprime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^ Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ Sloane, N. J. A. (ed.). "Sequence A006892 (Representation as a sum of squares requires n squares with greedy algorithm)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ "Tables of imaginary quadratic fields with small class number". numbertheory.org.