Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

232 (number)

From Wikipedia, the free encyclopedia

232 (two hundred [and] thirty-two) is thenatural number following231 and preceding233.

In mathematics

[edit]
Natural number
← 231232 233 →
Cardinaltwo hundred thirty-two
Ordinal232nd
(two hundred thirty-second)
Factorization23 × 29
Primeno
Greek numeralΣΛΒ´
Roman numeralCCXXXII,ccxxxii
Binary111010002
Ternary221213
Senary10246
Octal3508
Duodecimal17412
HexadecimalE816

232 is both acentral polygonal number[1] and acake number.[2]It is both adecagonal number[3] and a centered 11-gonal number.[4] It is alsoarefactorable number,[5]a Motzkin sum,[6]anidoneal number,[7] aRiordan number and anoncototient.[8]

232 is atelephone number: in a system of seven telephone users, there are 232 different ways of pairing up some of the users.[9][10]There are also exactly 232 different eight-vertex connectedindifference graphs, and 232bracelets with eight beads of one color and seven of another.[11] Because this number has the form232 = 44 − 4!, it follows that there are exactly 232 different functions from a set of four elements to a proper subset of the same set.[12]

References

[edit]
  1. ^Sloane, N. J. A. (ed.)."Sequence A000124 (Central polygonal numbers (the Lazy Caterer's sequence))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^Sloane, N. J. A. (ed.)."Sequence A000125 (Cake numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^Sloane, N. J. A. (ed.)."Sequence A001107 (10-gonal (or decagonal) numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^Sloane, N. J. A. (ed.)."Sequence A069125 (Centered 11-gonal numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation..
  5. ^Sloane, N. J. A. (ed.)."Sequence A033950 (Refactorable numbers: number of divisors of n divides n)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^Sloane, N. J. A. (ed.)."Sequence A005043 (Motzkin sums)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  7. ^Sloane, N. J. A. (ed.)."Sequence A000926 (Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ^Sloane, N. J. A. (ed.)."Sequence A005278 (Noncototients)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ^Sloane, N. J. A. (ed.)."Sequence A000085 (Number of self-inverse permutations on n letters, also known as involutions)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. ^Peart, Paul; Woan, Wen-Jin (2000),"Generating functions via Hankel and Stieltjes matrices"(PDF),Journal of Integer Sequences,3 (2), Article 00.2.1,Bibcode:2000JIntS...3...21P,MR 1778992, archived fromthe original(PDF) on 2015-09-24, retrieved2014-08-04.
  11. ^Sloane, N. J. A. (ed.)."Sequence A007123 (Number of connected unit interval graphs with n nodes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ^Sloane, N. J. A. (ed.)."Sequence A036679 (n^n - n!)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.


0 to 199
200 to 399
400 to 999
1000s and 10,000s
1000s
10,000s
100,000s to 10,000,000,000,000s
Stub icon

This article about anumber is astub. You can help Wikipedia byadding missing information.

Retrieved from "https://en.wikipedia.org/w/index.php?title=232_(number)&oldid=1166783558"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp