6716
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12432
- Proper Divisor Sum (Aliquot Sum)
- 5716
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- 0
- Radical
- 3358
- 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
- 88
- 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
- Quadruples of different integers from [ 1,n ] with no common factors between triples.at n=23A015625
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=26A024480
- a(n) = floor(binomial(2*n,n)/3^n).at n=39A024503
- Expansion of 1/((1-x)^2(1-x^2)(1-x^3)(1-x^5)) in powers of x.at n=41A028291
- Scan decimal expansion of Pi until all n-digit strings have been seen; a(n) is last string seen.at n=3A032510
- n*10^3-1, n*10^3-3, n*10^3-7 and n*10^3-9 are all prime.at n=4A064977
- a(1) = 1, a(n+1) is the sum of a(n) and floor( arithmetic mean of a(1) ... a(n) ).at n=34A065094
- a(n) = A000203(n)^2 - A001157(n) = sigma(n)^2 - sigma_2(n).at n=41A066293
- Triangle read by rows: T(n,k) is the number of k-matchings in the P_3 X P_n lattice graph.at n=46A100245
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having length of first descent equal to k (1<=k<=n; n>=1). A hill in a Dyck path is a peak at level 1.at n=56A118972
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having length of first descent equal to k (1<=k<=n; n>=1). A hill in a Dyck path is a peak at level 1.at n=68A118972
- Number of hill-free Dyck paths of semilength n+2 and having length of first descent equal to 2 (a hill in a Dyck path is a peak at level 1).at n=9A118973
- Number of triples (p,q,r) of primes with p<q<r<=prime(n), p+q>r, q+r>p and r+p>q.at n=48A138226
- 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, -1), (-1, -1, 0), (-1, 1, 1), (1, 0, 1), (1, 1, 0)}.at n=7A150387
- Number of 4-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=15A187157
- G.f. 1/sum(k>=0, (-1)^k * x^(k*(k+1)/2)).at n=38A208061
- G.f. satisfies: A(x) = 1 + x*A(x)/A(-x) + x^2*A(x)*A(-x).at n=18A208889
- Number T(n,k) of solid standard Young tableaux of n cells and height = k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=39A214753
- 16k^2-16k-4 interleaved with 16k^2+4 for k>=0.at n=42A216871
- Number of foldings of n labeled stamps in which both end leaves are inwards.at n=9A223095