6164
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 11424
- Proper Divisor Sum (Aliquot Sum)
- 5260
- 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
- 2904
- Möbius Function
- 0
- Radical
- 3082
- 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
- 36
- 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 cycles induced by iterating the Gray-coding of an n-bit number: a(n+1) = a(n) + 2^n/C_n, where C_n = least power of 2 >= n (C_n is the length of the cycle), with a(0) = 1.at n=17A007886
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).at n=27A024588
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=26A025102
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=36A025513
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=37A027662
- Every run of digits of n in base 3 has length 2.at n=27A033001
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(2,5) and cn(1,5) + cn(4,5) <= cn(3,5).at n=41A039876
- Numbers k such that 63*2^k-1 is prime.at n=32A050557
- Total number of interior nodes in all essentially parallel series-parallel networks with n labeled edges, multiple edges allowed.at n=6A058479
- Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.at n=43A064623
- Number of polyominoes with n cells that tile the plane by 180-degree rotation (Conway criterion).at n=10A075202
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the four-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).at n=55A079220
- Number of Catalan objects fixed by four-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).at n=10A079225
- Center antidiagonal four in a tri-antidiagonal n-th Matrix generated triangular sequence: first element as 4==m[1,1,1].at n=49A124028
- a(n) = 3*a(n-1) - 4*a(n-2) + 6*a(n-3) - 4*a(n-4), with initial terms 0,1,2,4.at n=13A136427
- Number of (directed) Hamiltonian paths in the n-ladder graph.at n=55A137882
- Triangle, read by rows, T(n, k) = binomial(n, k) for n < 2 and binomial(n, k) + 4^(n-1) * binomial(n-2, k-1) otherwise.at n=24A146988
- 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, 1, 1), (0, 0, -1), (0, 1, 0), (1, 0, 1)}.at n=7A150260
- 4 times octagonal numbers: a(n) = 4*n*(3*n-2).at n=23A153794
- Partial sums of the generalized Cuban primes A007645.at n=35A172113