11360
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 27216
- Proper Divisor Sum (Aliquot Sum)
- 15856
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4480
- Möbius Function
- 0
- Radical
- 710
- Omega Function (Ω)
- 7
- 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
- Number of loopless rooted planar maps with 3 faces and n vertices and no isthmuses. Also a(n)=T(4,n-3), array T as in A049600.at n=37A006416
- Coefficient triangle of polynomials (rising powers) related to Pell number convolutions. Companion triangle is A058402.at n=7A058403
- Coefficient triangle of polynomials (falling powers) related to Pell number convolutions. Companion triangle is A058404.at n=8A058405
- Number of different products (including the empty product) of any subset of {1, 2, 3, ..., n}.at n=18A060957
- Number of permutations of {1,2,...,n} that result in a binary search tree with the minimum possible height.at n=8A076615
- Number of 4 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.at n=9A086114
- Numbers n such that p(12n) is prime, where p(n) is the number of partitions of n.at n=21A115214
- Unsigned row sums of triangle A114700.at n=19A116466
- a(n) = n*(a(n-1)-1) starting with a(0)=3.at n=8A117643
- a(n) = 15 + floor((2 + Sum_{j=1..n-1} a(j))/3).at n=23A120159
- 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, -1, 0), (-1, -1, 1), (-1, 0, 0), (1, 1, 0), (1, 1, 1)}.at n=7A151019
- a(n) = 36*n^2 - 17*n + 2.at n=17A157265
- a(n) is the sum of all possible pairs of the first n primes.at n=18A162867
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k 3-term arithmetic progressions (n>=0; 0<=k<=floor((n-1)^2/4)).at n=45A162982
- Second entry in row n of triangle in A169950.at n=25A169952
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=36A191111
- Number T(n,k) of permutations of {1,2,...,n} that result in a binary search tree of height k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=40A195581
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 110 in rows and columns.at n=37A202052
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209141; see the Formula section.at n=47A209142
- Sum of neighbor maps: number of n X 2 binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their king-move neighbors in a random 0..3 n X 2 array.at n=8A221066