6140
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12936
- Proper Divisor Sum (Aliquot Sum)
- 6796
- 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
- 2448
- Möbius Function
- 0
- Radical
- 3070
- 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
- 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
- Hit polynomials.at n=7A001884
- Maximal length of rook tour on an n X n board.at n=20A006071
- Poincaré series [or Poincare series] of Lie algebra associated with a certain braid group.at n=13A007991
- Number of lines through exactly 5 points of an n X n grid of points.at n=37A018812
- Number of lines through exactly 7 points of an n X n grid of points.at n=51A018814
- Reverse and add (in base 4).at n=15A035524
- Number of partitions of n such that cn(1,5) <= cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5).at n=71A036852
- Numbers whose base-4 representation contains exactly two 1's and four 3's.at n=28A045123
- Number of degree-n permutations of order dividing 10.at n=8A053500
- T(n,n-5), where T is the array in A055830.at n=14A055832
- Number of 2 X 2 matrices with elements from {0,1,2,...,n} and with Nim-Determinant 1. (The Nim-Determinant of the 2 X 2 matrix [a,b; c,d] is defined to be a*d xor b*c, where * denotes Nim-Multiplication.)at n=26A059954
- a(n) is the number of different degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n, i.e., count each degree only once.at n=34A060437
- a(n) = A000203(n)^2 - A001157(n) - 2n = sigma(n)^2 - sigma_2(n) - 2n.at n=62A066294
- Write Pi = 3.d(1)d(2)d(3)... where d(m) is the m-th digit of the decimal expansion of Pi. Then a(n) = m is the smallest integer such that 1/(n+1) < 0.d(m)d(m+1)d(m+2)... < 1/n.at n=47A073597
- First occurrence of n as a term in the continued fraction for log(2).at n=50A076592
- Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if -1<=i-j<=1 else m(i,j)=1.at n=37A080018
- Antidiagonal sums of square array A082011 divided by the number of the antidiagonal.at n=39A082015
- p such that p^4 + q^4 = r^4 + s^4 = a(n).at n=18A088728
- Start with 1, then alternately double or add 2.at n=21A099942
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having height of last peak equal to k.at n=33A109158