6484
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
- 5
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11354
- Proper Divisor Sum (Aliquot Sum)
- 4870
- 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
- 3240
- Möbius Function
- 0
- Radical
- 3242
- 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
- 31
- 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
- a(2n) = a(2n-1) + 3a(2n-2), a(2n+1) = 2a(2n) + 3a(2n-1).at n=10A002537
- Molien series for A_6.at n=44A008629
- Pisot sequence T(7,10), a(n) = floor(a(n-1)^2/a(n-2)).at n=33A020752
- T(n,0) + T(n,1) + ... + T(n,n), T given by A026681.at n=11A026688
- Expansion of 1/((1-3x)(1-4x)(1-7x)(1-12x)).at n=3A028042
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 40.at n=39A031538
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 74 ones.at n=0A031842
- Number of partitions of n with equal number of parts congruent to each of 1, 2 and 3 (mod 5).at n=56A035578
- Numerators of continued fraction convergents to sqrt(275).at n=6A041516
- Numbers k such that the k-th term of the EKG sequence (A064413(k)) has more than one controlling prime.at n=25A073735
- Consider 3 X 3 X 3 Rubik cube, but only allow the squares group to act; sequence gives number of positions that are exactly n moves from the start.at n=6A080627
- Beginning with 1, least number greater than the product of all previous terms having n divisors.at n=5A090256
- Terms in a specific cycle of length 29 of the map x->A098189(x).at n=20A098192
- Conjectured numbers n such that the trajectory of n as defined in A003508 is unique.at n=29A105233
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[(2^(m-1) + 2*m-2 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=48A146956
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[(2^(m-1) + 2*m-2 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=51A146956
- a(n) = ((4 + sqrt(7))^n + (4 - sqrt(7))^n)/2.at n=5A146964
- Number of 5-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=10A187158
- Binomial transform of the sequence of binomial(3n,n).at n=5A188686
- Augmentation of the triangle A062344. See Comments.at n=24A193601