This article needs additional citations for verification . (May 2010) (Learn how and when to remove this template message) |
| ||||
---|---|---|---|---|
[[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] | ||||
Cardinal | one hundred sixty | |||
Ordinal | 160th (one hundred sixtieth) | |||
Factorization | 25 × 5 | |||
Divisors | 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160 | |||
Greek numeral | ΡΞ´ | |||
Roman numeral | CLX | |||
Binary | 101000002 | |||
Ternary | 122213 | |||
Octal | 2408 | |||
Duodecimal | 11412 | |||
Hexadecimal | A016 |
160 (one hundred [and] sixty) is the natural number following 159 and preceding 161.
160 is the sum of the first 11 primes, as well as the sum of the cubes of the first three primes.
Given 160, the Mertens function returns 0. [1] 160 is the smallest number n with exactly 12 solutions to the equation φ(x) = n.
The Möbius function μ(n) is an important multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted μ(x).
In mathematics, the Mertens conjecture is the statement that the Mertens function is bounded by . Although now disproven, it has been shown to imply the Riemann hypothesis. It was conjectured by Thomas Joannes Stieltjes, in an 1885 letter to Charles Hermite, and again in print by Franz Mertens (1897), and disproved by Andrew Odlyzko and Herman te Riele (1985). It is a striking example of a mathematical conjecture proven false despite a large amount of computational evidence in its favor.
150 is the natural number following 149 and preceding 151.
The Meissel–Mertens constant, also referred to as Mertens constant, Kronecker's constant, Hadamard–de la Vallée-Poussin constant or the prime reciprocal constant, is a mathematical constant in number theory, defined as the limiting difference between the harmonic series summed only over the primes and the natural logarithm of the natural logarithm:
In number theory, the Mertens function is defined for all positive integers n as
1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it is often written with a comma separating the thousands unit: 1,000.
300 is the natural number following 299 and preceding 301.
400 is the natural number following 399 and preceding 401.
500 is the natural number following 499 and preceding 501.
700 is the natural number following 699 and preceding 701.
600 is the natural number following 599 and preceding 601.
800 is the natural number following 799 and preceding 801.
900 is the natural number following 899 and preceding 901. It is the square of 30 and the sum of Euler's totient function for the first 54 integers. In base 10 it is a Harshad number.
2000 is a natural number following 1999 and preceding 2001.
8000 is the natural number following 7999 and preceding 8001.
In number theory, Mertens' theorems are three 1874 results related to the density of prime numbers proved by Franz Mertens. "Mertens' theorem" may also refer to his theorem in analysis.
149 is the natural number between 148 and 150. It is also a prime number.
159 is a natural number following 158 and preceding 160.
363 is the natural number following 362 and preceding 364.
420 is the natural number following 419 and preceding 421.
Wikimedia Commons has media related to 160 (number) . |