 | This article needs additional citations for verification .(December 2012) |
| ||||
|---|---|---|---|---|
| Cardinal | one hundred seventy | |||
| Ordinal | 170th (one hundred seventieth) | |||
| Factorization | 2 × 5 × 17 | |||
| Divisors | 1, 2, 5, 10, 17, 34, 85, 170 | |||
| Greek numeral | ΡΟ´ | |||
| Roman numeral | CLXX | |||
| Binary | 101010102 | |||
| Ternary | 200223 | |||
| Senary | 4426 | |||
| Octal | 2528 | |||
| Duodecimal | 12212 | |||
| Hexadecimal | AA16 | |||
170 (one hundred [and] seventy) is the natural number following 169 and preceding 171.
170 is the smallest n for which φ(n) and σ(n) are both square (64 and 324 respectively). But 170 is never a solution for φ(x), making it a nontotient. Nor is it ever a solution to x - φ(x), making it a noncototient.
170 is a repdigit in base 4 (2222) and base 16 (AA), as well as in bases 33, 84, and 169. It is also a sphenic number.
170 is the largest integer for which its factorial can be stored in IEEE 754 double-precision floating-point format. This is probably why it is also the largest factorial that Google's built-in calculator will calculate, returning the answer as 170! = 7.25741562 × 10306.[ citation needed ]
There are 170 different cyclic Gilbreath permutations on 12 elements, [1] and therefore there are 170 different real periodic points of order 12 on the Mandelbrot set. [2]
In mathematics, the factorial of a non-negative integer , denoted by , is the product of all positive integers less than or equal to . The factorial of also equals the product of with the next smaller factorial:
In mathematics, the Fibonacci numbers, commonly denoted Fn , form a sequence, the Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes from 1 and 2. Starting from 0 and 1, the first few values in the sequence are:
The Mandelbrot set is the set of complex numbers for which the function does not diverge to infinity when iterated from , i.e., for which the sequence , , etc., remains bounded in absolute value.
2 (two) is a number, numeral and digit. It is the natural number following 1 and preceding 3. It is the smallest and only even prime number. Because it forms the basis of a duality, it has religious and spiritual significance in many cultures.
In logic, Richard's paradox is a semantical antinomy of set theory and natural language first described by the French mathematician Jules Richard in 1905. The paradox is ordinarily used to motivate the importance of distinguishing carefully between mathematics and metamathematics.
23 (twenty-three) is the natural number following 22 and preceding 24.
51 (fifty-one) is the natural number following 50 and preceding 52.
93 (ninety-three) is the natural number following 92 and preceding 94.
114 is the natural number following 113 and preceding 115.
In mathematics, and more particularly in number theory, primorial, denoted by "#", is a function from natural numbers to natural numbers similar to the factorial function, but rather than successively multiplying positive integers, the function only multiplies prime numbers.
144 is the natural number following 143 and preceding 145. 144 is a dozen dozens, or one gross.
720 is the natural number following 719 and preceding 721.
116 is the natural number following 115 and preceding 117.
118 is the natural number following 117 and preceding 119.
5000 is the natural number following 4999 and preceding 5001. Five thousand is the largest isogrammic number in the English language.
239 is the natural number following 238 and preceding 240.
In computational number theory, Williams's p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic-group factorisation algorithms. It was invented by Hugh C. Williams in 1982.
225 is the natural number following 224 and preceding 226.
In number theory, the Kempner function is defined for a given positive integer to be the smallest number such that divides the factorial . For example, the number does not divide , , or , but does divide ,so .
A Gilbreath shuffle is a way to shuffle a deck of cards, named after mathematician Norman Gilbreath. Gilbreath's principle describes the properties of a deck that are preserved by this type of shuffle, and a Gilbreath permutation is a permutation that can be formed by a Gilbreath shuffle.
