11242
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21312
- Proper Divisor Sum (Aliquot Sum)
- 10070
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 1
- Radical
- 11242
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- Coordination sequence for root lattice B_11.at n=2A022153
- a(n) = 2*n * Stirling2(n-1,2).at n=11A052749
- Numbers k such that phi(k)*k is a triangular number.at n=9A115910
- {2n}_{2n}.at n=52A122642
- Number of base 32 circular n-digit numbers with adjacent digits differing by 2 or less.at n=5A124998
- Triangle of coefficients from a polynomial recursion with row sum near =2*5^n: p(x,n)=(x + 1)*(p(x, n - 1) + 2*5^(n - 2)*(x + 5*x^Floor[n/2] + x^(n - 2))).at n=24A153354
- Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=5A208836
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=41A208840
- Number of 6 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=3A208843
- a(n) = F(n+8) - (1/6)*(n^4-2*n^3+26*n^2+47*n+132) where F(i) = Fibonacci numbers (A000045).at n=13A220889
- Number of (n+1)X(1+1) 0..3 arrays with the maximum minus the lower median of every 2X2 subblock equal.at n=2A237169
- Number of (n+1)X(3+1) 0..3 arrays with the maximum minus the lower median of every 2X2 subblock equal.at n=0A237171
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum minus the lower median of every 2X2 subblock equal.at n=3A237175
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum minus the lower median of every 2X2 subblock equal.at n=5A237175
- Number of magic labelings with magic sum n of 7th graph shown in link.at n=5A244875
- Triangle T(n,k) read by rows, where T(n,k) is the number of k-dimensional faces of the polytope that is the convex hull of all permutations of the list (0,1,...,1,2), where there are n - 1 ones, for n > 0. T(0,0) is 1.at n=63A259569
- Number of n X 2 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=9A278357
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 443", based on the 5-celled von Neumann neighborhood.at n=13A282260
- Expansion of Sum_{k>=0} binomial(2*k,k)*x^k/Product_{j=1..k} (1 - j*x).at n=6A305406
- Number of achiral polyomino rings of length 4n with fourfold rotational symmetry.at n=25A324409