6767
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6936
- Proper Divisor Sum (Aliquot Sum)
- 169
- 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
- 6600
- Möbius Function
- 1
- Radical
- 6767
- Omega Function (Ω)
- 2
- 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
- 150
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.at n=34A004966
- Spiral sieve using Fibonacci numbers.at n=18A005625
- Pisot sequence L(4,5).at n=17A018910
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=22A020445
- Pisot sequence L(7,10).at n=15A020743
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026769.at n=13A026891
- Numbers with exactly five distinct base-9 digits.at n=9A031986
- Second pentagonal numbers with odd index: a(n) = (2*n-1)*(3*n-1).at n=34A033568
- Number of permutations P of {1,2,...,n} such that P(1)=1 and |P^-1(i+1)-P^-1(i)| equals 1 or 2 for i=1,2,...,n-1.at n=22A038718
- Pisot sequence L(5,7).at n=16A048584
- Composite numbers x such that sigma(x+120) = sigma(x)+120.at n=20A054985
- a(n) = 10*n^2 + 7.at n=26A061722
- a(n) is the smallest integer k such that floor((3/2)^k)/floor((3/2)^n) is an integer greater than 1.at n=23A065644
- Expansion of (1-x)/(1-2*x^2-x^3).at n=22A078024
- a(1)=1, a(2)=1 and for n > 2, a(n) is the smallest positive integer such that the third-order absolute difference gives the Fibonacci numbers A000045 = {1,1,2,3,5,8,...}.at n=18A086651
- a(1)=1, a(2)=1 and for n > 2, a(n) is the smallest positive integer such that the third-order absolute difference gives the Fibonacci numbers A000045 = {1,1,2,3,5,8,...}.at n=19A086651
- Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).at n=18A100888
- Partial sums of (-1)^n*Fibonacci(n-1).at n=22A112469
- Number of base 19 circular n-digit numbers with adjacent digits differing by 1 or less.at n=7A124712
- a(n) = least k such that the remainder when 18^k is divided by k is n.at n=10A128158