232
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 450
- Proper Divisor Sum (Aliquot Sum)
- 218
- 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
- 112
- Möbius Function
- 0
- Radical
- 58
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 21
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- zweihundertzweiunddreißig· ordinal: zweihundertzweiunddreißigste
- English
- two hundred thirty-two· ordinal: two hundred thirty-second
- Spanish
- doscientos treinta y dos· ordinal: 232º
- French
- deux cent trente-deux· ordinal: deux cent trente-deuxième
- Italian
- duecentotrentadue· ordinal: 232º
- Latin
- ducenti triginta duo· ordinal: 232.
- Portuguese
- duzentos e trinta e dois· ordinal: 232º
Appears in sequences
- Dying rabbits: a(0) = 1; for 1 <= n <= 12, a(n) = Fibonacci(n); for n >= 13, a(n) = a(n-1) + a(n-2) - a(n-13).at n=13A000044
- a(n) = Fibonacci(n) - 1.at n=12A000071
- Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells.at n=7A000085
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=21A000124
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=11A000125
- Numbers that are the sum of 2 squares but not sum of 3 nonzero squares.at n=24A000549
- Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers).at n=47A000926
- a(n) = n^n - a(n-1), with a(1) = 1.at n=3A001099
- 10-gonal (or decagonal) numbers: a(n) = n*(4*n-3).at n=8A001107
- Crystal ball sequence for hyperbolic tessellation 3^7 (from triangle group (2,3,7)).at n=4A001360
- Winning moves in Fibonacci nim.at n=40A001581
- Total diameter of unlabeled trees with n nodes.at n=8A001851
- Beatty sequence of (5+sqrt(13))/2.at n=53A001956
- Palindromes in base 10.at n=32A002113
- Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 2.at n=34A002155
- a(1) = 3; for n > 1, a(n) = 4*phi(n); given a rational number r = p/q, where q>0, (p,q)=1, define its height to be max{|p|,q}; then a(n) = number of rational numbers of height n.at n=58A002246
- Period of decimal expansion of 1/(n-th prime) (0 by convention for the primes 2 and 5).at n=50A002371
- Numbers of the form (p^2 - 49)/120 where p is prime.at n=19A002382
- Squares written in base 7.at n=10A002440
- Number of integral points in a certain sequence of open quadrilaterals.at n=24A002578