6712
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12600
- Proper Divisor Sum (Aliquot Sum)
- 5888
- 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
- 3352
- Möbius Function
- 0
- Radical
- 1678
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- Expansion of tanh(sin(x)*x).at n=4A009800
- Number of cyclic compositions of n into parts >= 2.at n=24A032190
- Numbers k such that 21*2^k+1 is prime.at n=25A032360
- Numbers k such that 187*2^k+1 is prime.at n=9A032470
- Numbers whose base-5 representation contains exactly three 2's and two 3's.at n=25A045276
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and containing a total of k level steps H in all DHH...HU's, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=63A097107
- Array read by antidiagonals: Costs E[m,N] of m-ary Huffman trees of maximum height with N internal nodes (non-leaves) for minimizing absolutely ordered sequences of size n=2N+1; m > 1, N > 0.at n=58A098810
- a(n) = (1/6)*(n+1)*(10*n^2 + 17*n + 12).at n=15A102296
- Triangle read by rows: the numbers B_2(n,k) from the Harju and Nowotka paper.at n=42A102416
- Leading column of A102416.at n=12A102864
- Number of diagonal rectangles with corners on an n X n grid of points.at n=13A113751
- Numbers k such that k*(k+5) gives the concatenation of two numbers m and m-4.at n=7A116261
- Sums of rows of the triangle in A116366.at n=32A116367
- Numbers k such that the k-th triangular number contains only digits {2,5,8}.at n=6A119169
- a(n) = a(n-1) + 10*a(n-2) for n >= 2, a(0)=1, a(1)=2.at n=7A133577
- a(n) = 839*n.at n=8A135639
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[(3^(m-1) + 2*m-1 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=39A146957
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[(3^(m-1) + 2*m-1 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=41A146957
- a(n) is the smallest number not yet in the sequence such that the concatenation of all terms yields a periodic stream of digits 1, 2, 3, ..., 7 (repeat from 1).at n=24A165305
- 2-comma numbers: n occurs in the sequence S[k+1] = S[k] + 10*last_digit(S[k-1]) + first_digit(S[k]) for two different splittings n=concat(S[0],S[1]).at n=36A166512