6916
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 15680
- Proper Divisor Sum (Aliquot Sum)
- 8764
- 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
- 2592
- Möbius Function
- 0
- Radical
- 3458
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 106
- 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
- Number of n-bead bracelets (turnover necklaces) of two colors with 6 red beads and n-6 black beads.at n=22A005513
- 4-dimensional analog of centered polygonal numbers.at n=12A006322
- Numbers k such that k | 12^k + 12.at n=21A015904
- Number of (undirected) Hamiltonian paths in n-Moebius ladder.at n=19A020875
- Expansion of g.f. 1/((1-x)*(1-4*x)*(1-9*x)*(1-12*x)).at n=3A021974
- Multiplicity of highest weight (or singular) vectors associated with character chi_140 of Monster module.at n=37A034528
- Number of partitions of n into parts not of the form 19k, 19k+7 or 19k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=32A035976
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) <= cn(2,5) = cn(4,5).at n=68A036864
- Sums of 6 distinct powers of 3.at n=31A038468
- Numbers n such that there are equal numbers of 0's and 1's in first n digits of binary representation of Pi.at n=41A039624
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 3 skipped primes.at n=44A050770
- Number of ways to place 3 nonattacking queens on a 3 X n board.at n=22A061989
- Triangle read by rows: T(n,k) gives number of ways of arranging n chords on a circle with k simple intersections (i.e., no intersections with 3 or more chords) - positive values only.at n=53A067311
- Solution to the Dancing School Problem with 3 girls and n+3 boys: f(3,n).at n=19A079908
- a(n) = 19*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 19.at n=3A090308
- Numerator of Product_{k=0..n} ((2*k+1)/(2*k+2))^((-1)^t(k)) where t(k)=A010060(k) (Thue-Morse sequence).at n=11A094541
- Least middle side of 2^n primitive arithmetic triangles, i.e., primitive Heronian triangles whose sides are in arithmetic progression.at n=3A095288
- a(n) = 4*n^3 + 4.at n=12A100214
- Number of Gaussian integers z with abs(z) < n and gcd(n,z)=1.at n=46A103225
- Numbers k such that the k-th semiprime == 3 (mod k).at n=7A106128