11568
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 30008
- Proper Divisor Sum (Aliquot Sum)
- 18440
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 1446
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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
- Number of lines through at least 2 points of an n X n grid of points.at n=15A018808
- a(n) = solution to the postage stamp problem with 7 denominations and n stamps.at n=11A053346
- Least number x such that gcd(x, pi(x)) = n.at n=47A087271
- Triangle of numbers, called Y(1,2), related to generalized Catalan numbers A062992(n) = C(2;n+1) = A064062(n+1).at n=31A115195
- Terms of A068563 that are not terms of A124240.at n=45A124241
- Partial sums of A001605.at n=22A172115
- Number of n X 3 array permutations with each element not moving, or moving one space E, S or NW.at n=7A189604
- Number of n X 8 array permutations with each element not moving, or moving one space E, S or NW.at n=2A189609
- T(n,k)=Number of nXk array permutations with each element not moving, or moving one space E, S or NW.at n=47A189610
- T(n,k)=Number of nXk array permutations with each element not moving, or moving one space E, S or NW.at n=52A189610
- Triangular array: the self-fusion of (p(n,x)), where p(n,x)=sum{((k+1)^2)*x^(n-k) : 0<=k<=n}.at n=44A193961
- Mirror of the triangle A193961.at n=36A193962
- Mirror of the triangle A193961.at n=47A193962
- E.g.f. A(x) satisfies A(x) = (x + 3*exp(A(x)) - 3)/4.at n=4A201466
- Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two clockwise edge increases.at n=3A205979
- Number of (n+1)X5 0..2 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=0A205982
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=6A205986
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=9A205986
- The terminal Wiener index of the dendrimer D_n defined pictorially in Fig. 1 of the Heydari et al. reference.at n=4A227707
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=22A228963