11320
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25560
- Proper Divisor Sum (Aliquot Sum)
- 14240
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4512
- Möbius Function
- 0
- Radical
- 2830
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- Numbers that are the sum of 9 positive 7th powers.at n=43A003376
- a(n) is the smallest positive number such that the sum of A001032(n) consecutive squares starting with a(n)^2 is a square.at n=39A007475
- Number of cubefree words of length n on two letters.at n=22A028445
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 11 (most significant digit on left).at n=34A029456
- "CFJ" (necklace, size, labeled) transform of 1,2,3,4...at n=8A032136
- T(n,k) = S(2n,n-1,k-1), 0 <= k <= n, n >= 0, array S as in A050157.at n=41A050160
- T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157.at n=32A050163
- G.f.: 1 / Product_{k>=1} (1-x^k)^(k-1).at n=21A052847
- a(n) = T(n,n-4), array T as in A055807.at n=36A055809
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n and height k (can be easily expressed using RNA secondary structure terminology).at n=60A098076
- a(n) = n*(n+1)*(20*n-17)/6.at n=15A172117
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=32A191111
- Numbers of rank 10 in the poset of lunar numbers.at n=45A191752
- G.f. satisfies: A(x) = (A(x^2) + x)^2.at n=28A224272
- Expansion of g.f. x*(1+x+x^2)/(1-x^3-x^5).at n=55A226503
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 185", based on the 5-celled von Neumann neighborhood.at n=24A270636
- Positive integers congruent to 0 or 1 modulo 4 that cannot be written as x^3 + y^2 + z^2 with x,y,z nonnegative integers.at n=10A275083
- Number of n X n 0..1 arrays with every element equal to 1, 2, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=5A298771
- Number of nX6 0..1 arrays with every element equal to 1, 2, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=5A298773
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=60A298775