11326
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
- 8
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 8114
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4848
- Möbius Function
- -1
- Radical
- 11326
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 86
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals up to rotation and reflection.at n=9A003449
- Expansion of 1/((1-3x)(1-7x)(1-10x)(1-12x)).at n=3A028097
- Number of partitions satisfying (cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5) and cn(4,5) <= cn(2,5) and cn(4,5) <= cn(3,5)).at n=44A036803
- Number of polyhexes with n cells that tile the plane.at n=9A070766
- a(n) = (p^2 - p + 2)/2 for p = prime(n); number of squares modulo p^2.at n=35A072205
- Triangle T, read by rows, equal to the matrix cube of triangle A113084, which satisfies the recurrence: A113084(n,k) = [A113084^3](n-1,k-1) + [A113084^3](n-1,k).at n=11A113090
- Column 1 of triangle A113090.at n=3A113091
- Number of permutations of length n which avoid the patterns 1342, 3142, 4312; or avoid the patterns 3124, 3412, 3421.at n=8A116823
- A triangular sequence based on the first level sum of polynomial coefficients: p(x,n,m)=(1 - x)^(n + m + 1)*Sum[k^(n - 1)*(1 - k)^(m - 1)*x^k, {k, 0, Infinity}]/4.at n=29A168217
- A triangular sequence based on the first level sum of polynomial coefficients: p(x,n,m)=(1 - x)^(n + m + 1)*Sum[k^(n - 1)*(1 - k)^(m - 1)*x^k, {k, 0, Infinity}]/4.at n=36A168217
- Triangle read by rows: T(n,k) = number of nonequivalent dissections of an n-gon into k polygons by nonintersecting diagonals up to rotation and reflection.at n=64A295634
- Anagraprod Integers. Integers N that reproduce their multiset of digits when all the products of two successive digits of N are done (and considered together).at n=48A296451
- Number of compositions of n in which at most one part has even multiplicity.at n=15A322326
- Squarefree numbers k for which Q(k) - 6*k/Pi^2 sets a new record minimum, where Q(x) is the number of squarefree numbers up to x.at n=14A339865
- Number of compositions (ordered partitions) of n into at most 6 squarefree parts.at n=24A347783
- The total number of fixed points among all partitions of n, when parts are written in nondecreasing order.at n=32A357459
- Number of genetic relatives of a person M in a genealogical tree extending back n generations and where everyone has 6 children down to the generation of M.at n=4A358600
- Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} (-1)^n * x^n * (A(x) + x^(4*n-1))^(n+1).at n=17A363144
- a(n) = Sum_{j=1..n} Sum_{i=1..n} (j mod i).at n=36A367379
- Number of partitions of n that do not have a fixed point that is also a fixed point of the conjugate partition.at n=35A374782