6765
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 5331
- 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
- 3200
- Möbius Function
- 1
- Radical
- 6765
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- yes
- 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
- 137
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Denominators of cosecant numbers: -2*(2^(2*n-1)-1)*Bernoulli(2*n).at n=20A001897
- F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=10A001906
- Permanent of Schur's matrix of order 2n+1.at n=5A003112
- Divisors of 2^20 - 1.at n=34A003529
- Fully multiplicative with a(prime(k)) = Fibonacci(k+2).at n=60A003965
- a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=20A005013
- Column of Motzkin triangle A026300.at n=7A005324
- Coefficient of x^8 in expansion of (1+x+x^2)^n.at n=6A005716
- a(n) = n*(4*n+1).at n=41A007742
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 5.at n=28A013593
- Degree of variety K_{2,n}^3.at n=2A013700
- Odd Fibonacci numbers.at n=13A014437
- Form array in which n-th row is obtained by expanding (1+x+x^2)^n and taking the 2nd column from the center.at n=8A014531
- a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=7A015448
- Pisot sequence E(2,3).at n=17A020695
- Pisot sequences E(3,5), P(3,5).at n=16A020701
- Pisot sequences E(5,8), P(5,8).at n=15A020712
- a(n) = n*(15*n + 1)/2.at n=30A022273
- Number of partitions of n into parts of 5 kinds.at n=8A023004
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.at n=53A024466