232 (number)
In this article we want to explore the fascinating world of 232 (number). From its origins to its relevance today, 232 (number) has been a topic of interest to many people around the world. Throughout history, 232 (number) has played a crucial role in various aspects of society, culture and technology. Furthermore, 232 (number) has been the subject of debate and controversy, which has contributed to its complexity and continued evolution. Through this article, we hope to shed light on this exciting topic and provide a deeper insight into 232 (number) and its impact on the world we live in.
232 (two hundred thirty-two) is the natural number following 231 and preceding 233.
In mathematics
| ||||
|---|---|---|---|---|
| Cardinal | two hundred thirty-two | |||
| Ordinal | 232nd (two hundred thirty-second) | |||
| Factorization | 23 × 29 | |||
| Prime | no | |||
| Greek numeral | ΣΛΒ´ | |||
| Roman numeral | CCXXXII | |||
| Binary | 111010002 | |||
| Ternary | 221213 | |||
| Senary | 10246 | |||
| Octal | 3508 | |||
| Duodecimal | 17412 | |||
| Hexadecimal | E816 | |||
232 is both a central polygonal number and a cake number. It is both a decagonal number and a centered 11-gonal number. It is also a refactorable number, a Motzkin sum, an idoneal number, a Riordan number and a noncototient.
232 is a telephone number: in a system of seven telephone users, there are 232 different ways of pairing up some of the users. There are also exactly 232 different eight-vertex connected indifference graphs, and 232 bracelets with eight beads of one color and seven of another. 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.
References
- ^ Sloane, N. J. A. (ed.). "Sequence A000124 (Central polygonal numbers (the Lazy Caterer's sequence))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000125 (Cake numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A001107 (10-gonal (or decagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A069125 (Centered 11-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
- ^ Sloane, N. J. A. (ed.). "Sequence A033950 (Refactorable numbers: number of divisors of n divides n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A005043 (Motzkin sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000926 (Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A005278 (Noncototients)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000085 (Number of self-inverse permutations on n letters, also known as involutions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ 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 from the original (PDF) on 2015-09-24, retrieved 2014-08-04.
- ^ Sloane, N. J. A. (ed.). "Sequence A007123 (Number of connected unit interval graphs with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A036679 (n^n - n!)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
&sq=232_(number)&lang=en&file=File:Numbers.svg){kind=small} | This article about a number is a stub. You can help Wikipedia by expanding it. |