16213
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16768
- Proper Divisor Sum (Aliquot Sum)
- 555
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15660
- Möbius Function
- 1
- Radical
- 16213
- Omega Function (Ω)
- 2
- 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
- 115
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Strong pseudoprimes to base 61.at n=10A020287
- Number of achiral triangular n-ominoes (n-iamonds) (holes are allowed).at n=22A030223
- Number of partitionings of n X n checkerboard into two edgewise-connected sets.at n=4A068416
- Binomial transform of expansion of exp(cosh(2*x)).at n=7A081560
- Number of three-choice paths along a corridor of height 5, starting from the lower side.at n=10A085810
- Number of n X 3 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.at n=43A166830
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k blocks of even length.at n=21A180194
- Coefficient of x^2 in the reduction of the n-th Fibonacci polynomial by x^3->x^2+2.at n=15A192800
- Number of 5-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first and second differences in -n..n.at n=20A209009
- Numbers n such that (n^n-2)/(n-2) is an integer.at n=26A242787
- Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} j!*C(n-1,j-1)*T(n-j,k-1) if k != 0 else 1, n>=0, 0<=k<=n.at n=31A256895
- The Hwang-Deutsch function f_4(n).at n=46A260997
- Row lengths in A261644.at n=17A261646
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 43", based on the 5-celled von Neumann neighborhood.at n=13A278445
- Anagrexpo integers: integers N that exactly reproduce their set of digits when we form the set of exponentiation of pairs of adjacent digits, from left to right.at n=29A297627
- Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p).at n=38A325343
- Absolute multiplicative persistence: a(n) is the least number with multiplicative persistence n for some base b > 1.at n=15A330152
- Expansion of e.g.f. exp(-x * (1 - x)) / (1 - x)^3.at n=6A375425
- Array read by antidiagonals: T(m,n) is the number of minimal edge cuts in the grid graph P_m X P_n.at n=40A378932