32
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 63
- Proper Divisor Sum (Aliquot Sum)
- 31
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16
- Möbius Function
- 0
- Radical
- 2
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 5
- Smith Number
- no
Classification
- Natural
- yes
- Even
- yes
- Odd
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- yes
- Carmichael Number
- no
Names
- German
- zweiunddreißig· ordinal: zweiunddreißigste
- English
- thirty-two· ordinal: thirty-second
- Spanish
- treinta y dos· ordinal: 32º
- French
- trente-deux· ordinal: trente-deuxième
- Italian
- trentadue· ordinal: 32º
- Latin
- triginta duo· ordinal: 32.
- Portuguese
- trinta e dois· ordinal: 32º
Appears in sequences
- Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts.at n=16A000009
- Euler totient function phi(n): count numbers <= n and prime to n.at n=50A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=63A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=67A000010
- Smallest prime power >= n.at n=31A000015
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=31A000027
- Numbers that are not squares (or, the nonsquares).at n=26A000037
- Generalized tangent numbers d(n,1).at n=15A000061
- Generalized tangent numbers d(n,1).at n=19A000061
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=22A000062
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=16A000069
- Number of trees of diameter 4.at n=10A000094
- Number of transformation groups of order n.at n=20A000113
- Number of transformation groups of order n.at n=30A000113
- Number of transformation groups of order n.at n=62A000113
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=3A000118
- Number of trees of diameter 5.at n=9A000147
- Number of ways of writing n as a sum of 16 squares.at n=1A000152
- a(n) = n*a(n-1) + (n-2)*a(n-2), with a(0) = 0, a(1) = 1.at n=4A000153
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=19A000201