11522
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19776
- Proper Divisor Sum (Aliquot Sum)
- 8254
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4932
- Möbius Function
- -1
- Radical
- 11522
- 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
- 174
- 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
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=41A000125
- Coordination sequence for CaF2(1), F position.at n=36A009924
- a(0) = 1, a(n) = 20*n^2 + 2 for n>0.at n=24A010010
- Expansion of 1/((1-3x)(1-6x)(1-11x)(1-12x)).at n=3A028088
- Number of asymmetric types of (3,n)-hypergraphs under action of symmetric group S_3.at n=11A055536
- Arrange n^2 octagons that each have area 7 so that they leave (n-1)^2 square gaps each with area 2; a(n) is the total area of these polygons.at n=35A086640
- a(n) = (4*n^3 + 6*n^2 + 8*n + 6)/3.at n=20A100504
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2 starting at an odd level (0<=k<=floor(n/2)-1 for n>=2; k=0 for n=0,1).at n=41A114463
- Numbers whose square is a permutational number A134640.at n=32A134742
- A McMullen transform involving x->x+1/x of Lehmer's polynomial gives the polynomial used to get this expansion sequence: p(x)=1 + x + 10 x^2 + 8 x^3 + 44 x^4 + 28 x^5 + 113 x^6 + 57 x^7 + 191 x^8 + 79 x^9 + 227 x^10 + 79 x^11 + 191 x^12 + 57 x^13 + 113 x^14 + 28 x^15 + 44 x^16 + 8 x^17 + 10 x^18 + x^19 + x^20.at n=15A143465
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 0), (0, 1, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150798
- Expansion of 2*x^2 *(4 +7*x +5*x^2 -x^3 -4*x^4 +6*x^6 +4*x^7 -x^8 -2*x^9) / ((1+x)^2 *(1+x+x^2)^2 *(1-x)^4) .at n=40A187062
- Least b > p_n^2 such that [p_1^2,p_2^2,...,p_n^2] in base b is prime, where p_j denotes the j-th prime.at n=26A224197
- Generalized Markoff numbers: largest of 7-tuple of positive numbers a, b, c, d, e, f, g satisfying the Markoff(7) equation a^2+b^2+c^2+d^2+e^2+f^2+g^2 = 2abcdefg.at n=24A227210
- 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 157", based on the 5-celled von Neumann neighborhood.at n=26A279470
- Number of 6 X n 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=13A281474
- Numbers missing from A317415.at n=28A317417
- Number of maximal 1-intersecting families of 2-sets of [n] = {1,2,...,n}.at n=41A318111