6056
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11370
- Proper Divisor Sum (Aliquot Sum)
- 5314
- 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
- 3024
- Möbius Function
- 0
- Radical
- 1514
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 111
- 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
- Fourier coefficients of E_{infinity,4}.at n=18A007331
- Coordination sequence T3 for Zeolite Code MEP.at n=46A008159
- Number of 5-tuples of different integers from [ 2,n ] with no global factor.at n=16A015641
- a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A026907.at n=7A026915
- a(n) = Sum_{k=0..n-2} T(n,k) * T(n,k+2), with T given by A026747.at n=5A027225
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 37.at n=37A031535
- a(n) = A045820(n)/2.at n=11A045822
- a(n) = A004017(n)/2.at n=8A045825
- Smallest member of triple of consecutive numbers each of which is the sum of two different nonzero squares.at n=30A064715
- Smallest member of three consecutive numbers each of which is the sum of two nonzero squares (not necessarily different).at n=35A064716
- Lesser of three consecutive nonsquare integers each of which is the sum of two squares.at n=28A073412
- a(n) = floor(T(n+1)!*T(n-1)!/(T(n)!)^2), where T(n) = n(n+1)/2 = the n-th triangular number.at n=39A077539
- Pascal-(1,4,1) array.at n=62A081579
- Pascal-(1,4,1) array.at n=58A081579
- Fourth row of the Pascal-(1,4,1) array A081579.at n=7A081588
- Numbers k such that k, k+1 and k+2 are sums of 2 squares.at n=45A082982
- Sequence coincides with union of its first and 2nd binomial transforms, ordered by size, with a(0)=1.at n=17A090859
- Numbers k such that 8*R_k - 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=18A099422
- Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k returns to the x-axis (0<=k<=floor(n/2)). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1.at n=22A114692
- a(n) = Sum {j=1..n} j*A001462(j).at n=36A143125