6788
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 6
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11886
- Proper Divisor Sum (Aliquot Sum)
- 5098
- 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
- 3392
- Möbius Function
- 0
- Radical
- 3394
- 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
- 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
- Smallest number of multiplicative persistence n.at n=6A003001
- Coordination sequence T1 for Coesite.at n=44A008267
- Smallest number of persistence n over product-of-nonzero-digits function.at n=6A014120
- Number of lines through exactly 5 points of an n X n grid of points.at n=38A018812
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number).at n=16A023488
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th non-Lucas number).at n=16A023494
- a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=18A023499
- Smallest n-digit number with maximal multiplicative persistence A014553.at n=3A046149
- Numbers with multiplicative persistence value 6.at n=0A046515
- The minimal number which has multiplicative persistence 6 in base n.at n=3A064870
- Triangle T(n,k) defined by Sum_{1<=k<=n} T(n,k)*u^k*t^n/n! = exp(((1-t)*(1-t^2)*(1-t^3)...)^(-u)-1).at n=16A066045
- CATS sequence: cube-add-then-sort variation of RATS (reverse, add then sort) sequence.at n=17A079320
- a(n) = ceiling(((1*n^0 + 1*n^1 + 2*n^2 + 4*n^3)/(1*n^0 + 2*n^1 + 1*n^2))^2).at n=21A085505
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.at n=7A088066
- Numbers m such that the numerator of Sum_{i=1..m} (i-1)/i is prime.at n=50A091815
- Structured octagonal anti-diamond numbers (vertex structure 7).at n=11A100187
- Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 63 for n > 0.at n=17A101079
- Trajectory of 6788 under "x -> product of digits of x" map.at n=0A121106
- a(n) integers with digit sum a(n); a(n+1) is the smallest integer > a(n).at n=38A136317
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 00100-00100-11111 pattern in any orientation.at n=22A147000