6796
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11900
- Proper Divisor Sum (Aliquot Sum)
- 5104
- 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
- 3396
- Möbius Function
- 0
- Radical
- 3398
- Omega Function (Ω)
- 3
- 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
- 62
- 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 paraffins.at n=30A005999
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 50 ones.at n=16A031818
- Multiplicity of highest weight (or singular) vectors associated with character chi_132 of Monster module.at n=41A034520
- Number of fullerenes with 2n vertices (or carbon atoms), counting enantiomorphic pairs as distinct.at n=22A057210
- Number of open positions in the game Fair Share and Varied Pairs starting with n tokens.at n=31A060463
- Square array read by antidiagonals: number of ways a black pawn (starting at any square on the second rank) can (theoretically) end at various squares on an infinite chessboard.at n=65A062104
- Number of ways a black pawn (from any starting square on the second back rank) can (theoretically) end on the n-th square of the leftmost file counted from the back rank.at n=10A062106
- a(0) = 1; for n>0, a(n) = 1 + coefficient of x^n in expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1-x^n).at n=50A078658
- G.f.: Sum_{k >= 1} x^k/(1-x^k)^(k+1).at n=53A081543
- EULER transform of A001511.at n=21A092119
- a(0)=0 and for n>0, a(n) is the smallest positive integer that cannot be derived by the adding or subtracting at most three terms with values in {a(0),...,a(n-1)} allowing repeats.at n=46A096077
- G.f.: A(x) = Product_{n>=1} 1/(1 - 4^n*x^n)^(4/4^n); self-convolution of A110156.at n=6A110154
- Number of binary strings of length n with equal numbers of 0000 and 1111 substrings.at n=14A164154
- a(n) is the smallest term m in A173978 for which A020639(2m-3) = prime(n), n > 1.at n=26A173980
- 1-sequence of reduction of (3n-2) by x^2 -> x+1.at n=11A192312
- Expansion of x^4*(1-2*x+x^4)/((1+x)*(1-2*x)^2*(1-x-x^2)).at n=15A219753
- Number of n X n 0..3 arrays with rows nondecreasing and antidiagonals unimodal.at n=2A224018
- Number of n X 3 0..3 arrays with rows nondecreasing and antidiagonals unimodal.at n=2A224019
- T(n,k)=Number of nXk 0..3 arrays with rows nondecreasing and antidiagonals unimodal.at n=12A224024
- Number of 3 X n 0..3 arrays with rows nondecreasing and antidiagonals unimodal.at n=2A224025