Skip to content
Surf Wiki
Save to docs
general/integers

From Surf Wiki (app.surf) — the open knowledge base

32 (number)


FieldValue
number32
divisor1, 2, 4, 8, 16, 32
lang1ASCII value
lang1 symbol[space]

32 (thirty-two) is the natural number following 31 and preceding 33.

Mathematics

32 is the fifth power of two (2^{5}), making it the first non-unitary fifth-power of the form p^{5} where p is prime. 32 is the totient summatory function \Phi(n) over the first 10 integers, and the smallest number n with exactly 7 solutions for \varphi (n).

The aliquot sum of a power of two is always one less than the number itself, therefore the aliquot sum of 32 is 31.

\begin{align} 32 & = 1^{1} + 2^{2} + 3^{3} \ 32 & = (1\times4)+(2\times5)+(3\times6) \ 32 & = (1\times2)+(1\times2\times3)+(1\times2\times3\times4) \ 32 & = (1\times2\times3)+(4\times5)+(6) \end{align}

The product between neighbor numbers of 23, the dual permutation of the digits of 32 in decimal, is equal to the sum of the first 32 integers: 22 \times 24= 528.

32 is also a Leyland number expressible in the form x^y + y^x, where: 32=2^{4} + 4^{2}.

The eleventh Mersenne number is the first to have a prime exponent (11) that does not yield a Mersenne prime, equal to: 2047 = 32^{2} + (31 \times 33) = 1024 + 1023 = 2^{11} - 1.

The product of the five known Fermat primes is equal to the number of sides of the largest regular constructible polygon with a straightedge and compass that has an odd number of sides, with a total of sides numbering 2^{32} - 1 = 3\cdot5\cdot17\cdot257\cdot65;537 = 4;294;967;295.

The first 32 rows of Pascal's triangle read as single binary numbers represent the 32 divisors that belong to this number, which is also the number of sides of all odd-sided constructible polygons with simple tools alone (if the monogon is also included).

There are also a total of 32 uniform colorings to the 11 regular and semiregular tilings.

There are 32 three-dimensional crystallographic point groups and 32 five-dimensional crystal families, and the maximum determinant in a 7 by 7 matrix of only zeroes and ones is 32. In sixteen dimensions, the sedenions generate a non-commutative loop \mathbb {S}{L} of order 32, and in thirty-two dimensions, there are at least 1,160,000,000 even unimodular lattices (of determinants 1 or −1); which is a marked increase from the twenty-four such Niemeier lattices that exists in twenty-four dimensions, or the single \mathrm E{8} lattice in eight dimensions (these lattices only exist for dimensions d \propto 8). Furthermore, the 32nd dimension is the first dimension that holds non-critical even unimodular lattices that do not interact with a Gaussian potential function of the form f_{\alpha} (r) = e^{-\alpha {r}} of root r and \alpha 0.

32 is the furthest point in the set of natural numbers \mathbb {N}_{0} where the ratio of primes (2, 3, 5, ..., 31) to non-primes (0, 1, 4, ..., 32) is \tfrac {1}{2}.

The trigintaduonions form a 32-dimensional hypercomplex number system.

In other fields

  • An international calling code for Belgium.

Notes

References

References

  1. {{Cite OEIS. A002088. Sum of totient function
  2. {{Cite OEIS. A001065. Sum of proper divisors (or aliquot parts) of n: sum of divisors of n that are less than n.
  3. {{Cite OEIS. A000217. Triangular numbers
  4. "Sloane's A007770 : Happy numbers". OEIS Foundation.
  5. "Sloane's A076980 : Leyland numbers". OEIS Foundation.
  6. (2008). "The Symmetries of Things". [[CRC Press]] ([[Taylor & Francis]]).
  7. {{Cite OEIS. A000225. a(n) equal to 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)
  8. {{Cite OEIS. A002808. The composite numbers: numbers n of the form x*y for x > 1 and y > 1.
  9. {{Cite OEIS. A00040. The prime numbers.
  10. (1996). "The Book of Numbers". Copernicus ([[Springer Publishing.
  11. (1987). "Tilings and Patterns". W. H. Freeman and Company.
  12. {{Cite OEIS. A004028. Number of geometric n-dimensional crystal classes.
  13. {{Cite OEIS. A004032. Number of n-dimensional crystal families.
  14. {{Cite OEIS. A003432. Hadamard maximal determinant problem: largest determinant of a (real) {0,1}-matrix of order n.
  15. (2005). "The Subloop Structure of the Cayley-Dickson Sedenion Loop". The [[Mathematical Society of the Philippines]].
  16. (November 15, 2014). "Integral Octonions (Part 8)". [[University of California, Riverside.
  17. (June 2022). "Critical Even Unimodular Lattices in the Gaussian Core Model". [[Oxford University Press]].
  18. {{Cite OEIS. A156274. List of prime pairs of the form (p, p+6).
  19. {{Cite OEIS. A028442. Numbers k such that Mertens's function M(k) (A002321) is zero.
  20. Saniga, Metod. (2015). "From Cayley-Dickson Algebras to Combinatorial Grassmannians". MDPI AG.
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about 32 (number) — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report