6764
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12600
- Proper Divisor Sum (Aliquot Sum)
- 5836
- 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
- 3168
- Möbius Function
- 0
- Radical
- 3382
- 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
- 137
- 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(n) = Fibonacci(n) - 1.at n=19A000071
- Powers of rooted tree enumerator.at n=15A000439
- a(n) = 7*a(n-1) - a(n-2) + 5.at n=4A003481
- Möbius transform of A003965.at n=60A003980
- Fibonacci(n) - (-1)^n.at n=19A007492
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=54A011904
- Pisot sequence T(4,7).at n=15A020732
- a(n) = (d(n)-r(n))/2, where d = A026066 and r is the periodic sequence with fundamental period (1,0,0,0).at n=31A026067
- Duplicate of A035508.at n=9A027418
- Numbers with exactly five distinct base-9 digits.at n=6A031986
- Inverse Stolarsky array read by antidiagonals.at n=53A035507
- a(n) = Fibonacci(2*n+2) - 1.at n=9A035508
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(1,5) + cn(4,5) + cn(3,5).at n=31A039902
- Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=19A051258
- a(n) is twice the smallest k such that A051686(k) = prime(n).at n=32A051692
- Twice the positions in A051686 at which new primes appear in that sequence.at n=33A051861
- Numbers that are Fibonacci numbers plus or minus 1.at n=34A061489
- Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=19A063704
- Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=19A063706
- a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).at n=18A070964