6759
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9776
- Proper Divisor Sum (Aliquot Sum)
- 3017
- 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
- 4500
- Möbius Function
- 0
- Radical
- 2253
- 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
- 62
- 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
- no
- Odd
- yes
Appears in sequences
- Number of connected vertex-transitive graphs with n nodes.at n=32A006800
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 10 (most significant digit on left).at n=12A029479
- Positive numbers having the same set of digits in base 5 and base 9.at n=42A037432
- Denominators of continued fraction convergents to sqrt(743).at n=6A042431
- Number of graphs with n nodes and n+1 edges.at n=6A048179
- Number of connected circulant graphs on n nodes.at n=32A075545
- Indices of record values in A046641.at n=42A145772
- a(n) = 729*n - 531.at n=9A156771
- a(n) = 338*n - 1.at n=19A157999
- a(n) = 169*n - 1.at n=39A158219
- a(n) = 676*n - 1.at n=9A158393
- a(n) = 10*n^2 - 1.at n=25A158447
- a(n) = 40*n^2 - 1.at n=12A158598
- Triangle read by rows: a(1,1) = 1. a(m,m) = sum of all terms in rows 1 through m-1. a(m,n) = a(m-1,n) + (sum of all terms in rows 1 through m-1), for n < m.at n=25A159927
- a(n) = n*(2*n^2 + 5*n + 13)/2.at n=18A163655
- Partial sums of Pillai primes (A063980).at n=30A172034
- a(n) = a(n-1)+a(n-2)-Floor(a(n-3)/2)-Floor(a(n-8)/2); initial terms are 0, 1, 1, 2, 3, 5, 7, 11.at n=25A173199
- Number of nX3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=6A207237
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=42A207242
- Number of 7Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=2A207247