177 (number)
| ||||
|---|---|---|---|---|
| Cardinal | one hundred seventy-seven | |||
| Ordinal | 177th (one hundred seventy-seventh) | |||
| Factorization | 3 × 59 | |||
| Divisors | 1, 3, 59, 177 | |||
| Greek numeral | ΡΟΖ´ | |||
| Roman numeral | CLXXVII | |||
| Binary | 101100012 | |||
| Ternary | 201203 | |||
| Senary | 4536 | |||
| Octal | 2618 | |||
| Duodecimal | 12912 | |||
| Hexadecimal | B116 | |||
177 (one hundred [and] seventy-seven) is the natural number following 176 and preceding 178.
In mathematics[edit]
It is a Leyland number since 177 = 27 + 72.[1]
It is a 60-gonal number,[2] and an arithmetic number,[3] since the mean of its divisors (1, 3, 59 and 177) is equal to 60, an integer.
177 is a Leonardo number, part of a sequence of numbers closely related to the Fibonacci numbers.[4] In graph enumeration, there are 177 undirected graphs (not necessarily connected) that have seven edges and no isolated vertices,[5] and 177 rooted trees with ten nodes and height at most three.[6] There are 177 ways of re-connecting the (labeled) vertices of a regular octagon into a star polygon that does not use any of the octagon edges.[7]
In other fields[edit]
177 is the second highest score for a flight of three darts, below the highest score of 180.[8]
See also[edit]
References[edit]
- ^ Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A249911 (60-gonal number)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A003601 (Numbers n such that the average of the divisors of n is an integer)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A001595". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000664 (Number of graphs with n edges)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A001383 (Number of n-node rooted trees of height at most 3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A002816 (Number of polygons that can be formed from n points on a circle, no two adjacent)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ "Pub quiz". Tes Magazine. February 9, 2007. Retrieved 2022-06-27.
