16432
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 34720
- Proper Divisor Sum (Aliquot Sum)
- 18288
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7488
- Möbius Function
- 0
- Radical
- 2054
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 40
- Smith Number
- no
- Vampire 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
Appears in sequences
- a(n) = [ C(2n,n)/2^(n+3) ].at n=20A024506
- a(n) = (d(n)-r(n))/2, where d = A026046 and r is the periodic sequence with fundamental period (0,1,0,1).at n=42A026047
- Numerators of continued fraction convergents to sqrt(257).at n=2A041480
- Replace 0 with 0000 in binary representation of n.at n=37A084473
- Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=19A157116
- a(n) = Sum_{d|n} phi(n/d)*2^(d+1), with a(0) = 0.at n=13A160619
- Number of -3..3 arrays x(0..n-1) of n elements with zero sum and elements alternately strictly increasing and strictly decreasing.at n=7A200052
- T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and elements alternately strictly increasing and strictly decreasing.at n=52A200057
- a(n) = n*(n^2 + 3)/2.at n=32A229183
- Number of nonisomorphic subsets of n cards of a standard deck of 52 cards under action of symmetric group S_4 acting on the suits.at n=4A245228
- Number of nonisomorphic subsets of n cards of a standard deck of 52 cards under action of symmetric group S_4 acting on the suits.at n=48A245228
- Value x in the solution of x^2-D*y^2=-1 as D runs through A003654.at n=41A249021
- 6-Modular Catalan Numbers C_{n,6}.at n=10A261589
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 462", based on the 5-celled von Neumann neighborhood.at n=37A288437
- Bases b for which there exists an integer y such that y^3 in base b looks like [c,d,c,d] for some base-b digits c, d.at n=42A290176
- a(n) is the smallest positive k such that k^2 + 1 has 2*n divisors, or -1 if no such k exists.at n=14A353008
- G.f. A(x) satisfies A(x) = 1 / (1 - x * (1 + x + x^2 + x^3 + x^4) * A(x^5)).at n=15A367654
- Number of integer compositions of n whose leaders of strictly decreasing runs are identical.at n=31A374760