#jsDisabledContent { display:none; } My Account | Register | Help

# 232 (number)

Article Id: WHEBN0006317400
Reproduction Date:

 Title: 232 (number) Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### 232 (number)

232 (two hundred [and] thirty two) is the natural number following 231 and preceding 233.

 ← 231 232 233 →
Cardinal two hundred thirty-two
Ordinal 232nd
(two hundred and thirty-second)
Factorization 23× 29
Prime no
Roman numeral CCXXXII
Binary 111010002
Ternary 221213
Quaternary 32204
Quinary 14125
Senary 10246
Octal 3508
Duodecimal 17412
Vigesimal BC20
Base 36 6G36

232 is both a central polygonal number[1] and a cake number.[2] It is both a decagonal number[3] and a centered 11-gonal number.[4] It is also a refactorable number,[5] a Motzkin sum,[6] an idoneal number,[7] and a noncototient.[8]

232 is a telephone 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 connected indifference graphs, and 232 bracelets with eight beads of one color and seven of another.[11] Because this number has the form 232 = 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

1. ^ "Sloane's A000124 : Central polygonal numbers (the Lazy Caterer's sequence)", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
2. ^ "Sloane's A000125 : Cake numbers", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
3. ^ "Sloane's A001107 : 10-gonal (or decagonal) numbers", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
4. ^ "Sloane's A069125 : Centered 11-gonal numbers", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
5. ^ "Sloane's A033950 : Refactorable numbers: number of divisors of n divides n", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
6. ^ "Sloane's A005043 : Motzkin sums", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
7. ^ "Sloane's A000926 : Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers)", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
8. ^ "Sloane's A005278 : Noncototients", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
9. ^ "Sloane's A000085 : Number of self-inverse permutations on n letters, also known as involutions", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
10. ^ .
11. ^ "Sloane's A007123 : Number of connected unit interval graphs with n nodes", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
12. ^ "Sloane's A036679 : n^n - n!", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.

Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.