6755
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
- 8
- Divisor Sum
- 9312
- Proper Divisor Sum (Aliquot Sum)
- 2557
- 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
- 4608
- Möbius Function
- -1
- Radical
- 6755
- Omega Function (Ω)
- 3
- 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
- 36
- 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
- Generalized divisor function. Number of partitions of n with exactly three part sizes.at n=46A002134
- a(n) = n*(11*n+1)/2.at n=35A022269
- Duplicate of A022269.at n=34A026817
- Numbers with exactly five distinct base-9 digits.at n=1A031986
- Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i+1,j).at n=53A038738
- Prime alternating tangle types (of knots) with n crossings.at n=8A047051
- Third column of triangle A054450 (partial row sums of unsigned Chebyshev triangle A049310).at n=17A054451
- Partial sums of A027941(n-1) with a(-1) = 0.at n=10A054452
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.at n=42A064933
- G.f.: 1/B(x) where B(x) = g.f. for A072964.at n=18A073420
- Row sums of triangle A084408.at n=24A084411
- a(n) = Sum_{k=0..floor(n/2)} binomial(n-k+3, k).at n=16A099571
- a(n) = F(4n) - 2n, where F(n) = Fibonacci numbers A000045.at n=4A099922
- Number of different values assumed by a/b+c/d as a,b,c,d range between 1 and n.at n=15A119868
- Riordan array ((1-x)/(1-3*x+x^2),x/(1-x)) read by rows.at n=69A125171
- Antidiagonal sums of triangular array T defined in A014430: T(j,k) = binomial(j+1, k) - 1 for 1 <= k <= j.at n=16A129696
- Binomial transform of [1, 3, 7, 0, 0, 0, ...].at n=44A140063
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1100-0111-0010 pattern in any orientation.at n=12A146459
- a(n) = Sum_{d|n} d*sigma(n/d)^d.at n=11A185302
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,4,3,2,0 for x=0,1,2,3,4.at n=6A196927