11253
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17024
- Proper Divisor Sum (Aliquot Sum)
- 5771
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6600
- Möbius Function
- 0
- Radical
- 1023
- Omega Function (Ω)
- 4
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Apéry numbers: a(n) = Sum_{k=0..n} binomial(n,k)^2 * binomial(n+k,k).at n=5A005258
- Crystal ball sequence for A_5 lattice.at n=5A008386
- a(n) = S(n) + c(n) where S(n) = [ (3/2)^n ] and c is the complement of S.at n=22A022808
- Convolution of natural numbers with Beatty sequence for the golden mean A000201.at n=33A023541
- a(n) = Sum_{k=0..floor(n/2)} T(n-k,k), T given by A026758.at n=18A026768
- a(n) = Sum_{k=0..n} (k+1) * A026714(n, k).at n=9A027205
- Number of partitions of n into parts not of the form 17k, 17k+8 or 17k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=36A035969
- Numbers whose base-7 representation contains exactly four 4's.at n=24A043412
- Numbers whose base-5 representation contains exactly three 0's and three 3's.at n=6A045202
- Numbers n such that 289*2^n-1 is prime.at n=17A050903
- Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero.at n=10A058877
- Sum of divisors of twice square numbers.at n=44A065765
- a(n) = 11*n^2 + 22*n.at n=30A067705
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5*p-4, where a(i,p) satisfies Sum_{i=1..n} C(i+4,5)^p = 6 * C(n+5,6) * Sum_{i=1..5*p-4} a(i,p) * C(n-1,i-1)/(i+5).at n=12A087109
- Expansion of (1+x^2)/(1-x-x^5) = (1+x^2)/((1-x+x^2)*(1-x^2-x^3)).at n=34A098523
- Table of crystal ball sequences for A_n lattices read by antidiagonals.at n=60A099608
- Structured snub dodecahedral numbers.at n=8A100151
- Square array, read by antidiagonals, where row n equals the crystal ball sequence for the A_n lattice.at n=60A108625
- Numbers k such that the sum of the Carmichael lambda functions of the divisors is a proper divisor of k.at n=12A131492
- Triangle T(n,k)=number of forests of labeled rooted trees with n nodes, containing exactly k trees of height one, all others having height zero (n>=0, 0<=k<=floor(n/2)).at n=37A133399