Natural number
|
|---|
|
| Cardinal | one hundred thirty-two |
|---|
| Ordinal | 132nd
(one hundred thirty-second) |
|---|
| Factorization | 22 × 3 × 11 |
|---|
| Divisors | 1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 132 |
|---|
| Greek numeral | ΡΛΒ´ |
|---|
| Roman numeral | CXXXII,cxxxii |
|---|
| Binary | 100001002 |
|---|
| Ternary | 112203 |
|---|
| Senary | 3406 |
|---|
| Octal | 2048 |
|---|
| Duodecimal | B012 |
|---|
| Hexadecimal | 8416 |
|---|
132 (one hundred [and] thirty-two) is thenatural number following131 and preceding133. It is 11dozens.
132 is the sixthCatalan number.[1] With twelve divisors total where 12 is one of them, 132 is the 20threfactorable number, preceding thetriangular136.[2]
132 is anoblong number, as the product of 11 and 12[3] whose sum instead yields the 9thprime number23;[4] on the other hand, 132 is the99thcomposite number.[5]
Adding all two-digitpermutation subsets of 132 yields the same number:
.
132 is the smallest number indecimal with this property,[6] which is shared by264, 396 and 35964 (seedigit-reassembly number).[7]
The number ofirreducible trees with fifteenvertices is 132.[8]
In a
toroidal board in then–Queens problem, 132 is thecount of non-attacking queens,[9] with respectiveindicator of19[10] andmultiplicity of1444 =382[11] (where, 2 × 19 = 38).[12]
The exceptionalouter automorphism ofsymmetric groupS6 uniquely maps vertices to factorizations andedges to partitions in thegraph factors of thecomplete graph with six vertices (and fifteen edges)K6, which yields 132blocks inSteiner systemS(5,6,12).
- ^"Sloane's A000108 : Catalan numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-27.
- ^Sloane, N. J. A. (ed.)."Sequence A033950 (Refactorable numbers: number of divisors of k divides k. Also known as tau numbers.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-03-12.
- ^Sloane, N. J. A. (ed.)."Sequence A002378 (Oblong (or promic, pronic, or heteromecic) numbers: a(n) equal to n*(n+1).)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-03-12.
- ^Sloane, N. J. A. (ed.)."Sequence A000040 (The prime numbers.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-03-12.
- ^Sloane, N. J. A. (ed.)."Sequence A002808 (The composite numbers.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-03-12.
- ^Wells, D.The Penguin Dictionary of Curious and Interesting Numbers London: Penguin Group. (1987): 138
- ^Sloane, N. J. A. (ed.)."Sequence A241754 (Numbersn equal to the sum of all numbers created from permutations ofd digits sampled fromn)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^Sloane, N. J. A. (ed.)."Sequence A000014 (Number of series-reduced trees with n nodes.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2023-09-02.
- ^Sloane, N. J. A. (ed.)."Sequence A054502 (Counting sequence for classification of nonattacking queens on n X n toroidal board.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-02-10.
- ^Sloane, N. J. A. (ed.)."Sequence A054500 (Indicator sequence for classification of nonattacking queens on n X n toroidal board.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-02-10.
- ^Sloane, N. J. A. (ed.)."Sequence A054501 (Multiplicity sequence for classification of nonattacking queens on n X n toroidal board.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-02-10.
- ^I. Rivin, I. Vardi and P. Zimmermann (1994).The n-queens problem.American Mathematical Monthly. Washington, D.C.:Mathematical Association of America.101 (7): 629–639.doi:10.1080/00029890.1994.11997004JSTOR 2974691
|
|---|
|
|
|
400 to 999 |
|---|
| 400s, 500s, and 600s | 700s, 800s, and 900s | | |
|
|
1000s and 10,000s |
|---|
| 1000s | |
|---|
| 10,000s | |
|---|
|
100,000s to 10,000,000,000,000s |
|---|
- 100,000
- 1,000,000
- 10,000,000
- 100,000,000
- 1,000,000,000
- 10,000,000,000
- 100,000,000,000
- 1,000,000,000,000
- 10,000,000,000,000
|
|
|
