6672
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 17360
- Proper Divisor Sum (Aliquot Sum)
- 10688
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2208
- Möbius Function
- 0
- Radical
- 834
- Omega Function (Ω)
- 6
- 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
- 137
- 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 1/((1+x)*(1-x)^6).at n=14A001753
- a(n) = n*(13*n + 1)/2.at n=32A022271
- Convolution of Fibonacci numbers and composite numbers.at n=13A023609
- a(n) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=29A025193
- COMPOSE squares with squares.at n=5A030279
- a(n) = Sum_{d|8} phi(d)*n^(8/d).at n=3A054607
- a(n) = Sum_{d|n} phi(d)*3^(n/d).at n=8A054610
- Triangle T(n,k) = Sum_{d|n} phi(d)*k^(n/d).at n=30A054618
- Numbers k such that phi(x) = k has exactly 12 solutions.at n=25A060675
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=33A063052
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 87 ).at n=32A063360
- Convolution triangle of A002605(n) (generalized (2,2)-Fibonacci), n>=0.at n=38A073387
- Second convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.at n=6A073389
- Greedy frac multiples of Pi^2/6: a(1)=1, Sum_{n>=1} frac(a(n)*x) = 1 at x = Pi^2/6.at n=10A079937
- Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.at n=12A099771
- G.f.: A(x) = ( G(x)^5 - G(x^5) - 5*x*((1-x^4)/(1-x))/(1-x^5) )/(25*x^2) where G(x) is the g.f. of A110631.at n=12A111583
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 9 multiples of n-1, n-2, ..., 1, for n>=1.at n=39A113746
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 001 (n,k>=0).at n=41A118424
- Number of binary sequences of length n containing exactly one subsequence 001.at n=14A118425
- Expansion of b(q^2) * c(q^6) / (b(q) * c(q^3)) in powers of q where b(), c() are cubic AGM theta functions.at n=20A123629