6684
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15624
- Proper Divisor Sum (Aliquot Sum)
- 8940
- 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
- 2224
- Möbius Function
- 0
- Radical
- 3342
- 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
- 44
- Smith Number
- yes
- 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
- Numbers whose base-9 representation has exactly 5 runs.at n=29A043634
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=36A052477
- a(n) = 4*n^2 - 9*n + 6.at n=41A054556
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=32A058229
- Number of basis partitions (or basic partitions) of n.at n=46A066447
- Interprimes which are of the form s*prime, s=12.at n=19A075287
- Sum of n-th row of triangle in A079784.at n=7A079783
- Numbers k such that k!! - prime(k) is prime.at n=12A108420
- a(n) is the minimal k such that a deck of 2k cards is returned to its original state by n out-shuffles.at n=40A114894
- Numbers k such that k and k^2 use only the digits 4, 5, 6, 7 and 8.at n=8A137140
- Numbers k such that (k!-10)/10 is prime.at n=17A139205
- 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, 0), (-1, 1, -1), (0, 0, 1), (0, 1, -1), (1, -1, 0)}.at n=10A148083
- 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, 0, 0), (0, -1, 0), (1, 1, -1), (1, 1, 0)}.at n=8A149183
- a(n) = 216*n - 12.at n=30A154518
- Triangle read by rows: row n gives coefficients of expansion of polynomial p(k,n) in powers of k, defined by p(k, 0) = 1, p(k, 1) = 1+2*k; for n>1, p(k,n) = If[Mod[n, 2] == 0, (1 + 2*k)*p(k, n - 1) + n*Binomial[n + 1, n - 1]*k*(k + 1)*p(k, n - 2), (1 + 2*k)*(1 + 3*(p(k, n - 1) - 1))].at n=18A167883
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=26A178980
- Partial sums of floor(n^2/5) (A118015).at n=46A181640
- Number of ordered quadruples of distinct pairwise coprime positive integers with largest element n; also first differences of A015623.at n=52A185348
- Number of (n+1)X(n+1) 0..3 symmetric matrices containing all values 0..3 with every 2X2 subblock having two distinct values, and new values 0..3 introduced in lower triangle row major order.at n=3A210814
- Number of times prime(n) (the n-th prime) occurs as the least prime factor among numbers 1 .. (prime(n)^2 * prime(n+1)): a(n) = A078898(A251720(n)).at n=54A250477