11268
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 28574
- Proper Divisor Sum (Aliquot Sum)
- 17306
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 0
- Radical
- 1878
- Omega Function (Ω)
- 5
- 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
- 86
- 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
- Coefficients of ménage hit polynomials.at n=4A000185
- Number of partitions of n into parts not of the form 25k, 25k+4 or 25k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=36A036003
- Triangle read by rows, giving coefficients of the ménage hit polynomials ordered by descending powers. T(n, k) for 0 <= k <= n.at n=49A058087
- McKay-Thompson series of class 38a for Monster.at n=44A058658
- Triangle read by rows: T(n,k) = number of ways of seating n couples around a circular table so that exactly k married couples are adjacent (0 <= k <= n).at n=50A094314
- Expansion of x/((1-x-x^3)*(1-x)^4).at n=15A144898
- Triangle T(n, k) = coefficients of p(n,x), where p(n,x) = Sum_{j=0..n} (2*n*(n-j)!/(2*n-j)) * binomial(2*n-j, j) * (x-1)^j and p(0,x) = 1, read by rows.at n=50A156996
- Number of n X n symmetric binary arrays with rows, considered as graycode numbers, in nondecreasing order.at n=5A162056
- Number of n X n symmetric binary arrays with rows, considered as graycode numbers, in nondecreasing order, and no more than 6 ones in any row or column.at n=5A162061
- Number of n X n symmetric binary arrays with rows, considered as graycode numbers, in nondecreasing order, and no more than 7 ones in any row or column.at n=5A162062
- Number of n X n symmetric binary arrays with rows, considered as graycode numbers, in nondecreasing order, and no more than 8 ones in any row or column.at n=5A162063
- Number of n X n symmetric binary arrays with rows, considered as graycode numbers, in nondecreasing order, and no more than 9 ones in any row or column.at n=5A162064
- Conjectured positive numbers which have more than one representation (m,s) as a difference s^2 - m^5, m >= 1, s > 0.at n=26A177770
- Number of (n+3) X (n+3) 0..2 matrices with each 4 X 4 subblock idempotent.at n=6A224720
- Number of (n+3) X 10 0..2 matrices with each 4 X 4 subblock idempotent.at n=6A224727
- Number of overpal-free binary words of length n.at n=32A277277
- Triangle read by rows: T(n,k) = number of edges in a "frame" of size n X k (see Comments in A331457 for definition).at n=51A332600
- Irregular table read by rows: Take a Reuleaux triangle with all diagonals drawn, as in A340639. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.at n=43A340614
- a(n) = Sum_{x_1|n, x_2|n, x_3|n, x_4|n, x_5|n} gcd(x_1,x_2,x_3,x_4,x_5).at n=44A344139
- Triangle read by rows: T(n,k) is the number of noncrossing caterpillars with n edges and diameter k, 0 <= k <= n.at n=42A361357