6955
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9072
- Proper Divisor Sum (Aliquot Sum)
- 2117
- 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
- 5088
- Möbius Function
- -1
- Radical
- 6955
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 150
- 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
- Number of single component forests in Moebius ladder M_n.at n=3A020869
- Numbers k such that 261*2^k+1 is prime.at n=48A032507
- A simple grammar: pairs of cycles of sequences.at n=14A052821
- At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage.at n=24A064412
- Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1, 3), (5, 9), (7, 13), (11, 19), (15, 25), (17, 29), (21, 35), (23, 39), (27, 45), ... This is the sequence of the product of the members of pairs.at n=20A075320
- Semiperimeter of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=10A089549
- Column 3 of triangle A091602.at n=38A091606
- Structured triakis octahedral numbers (vertex structure 4).at n=12A100171
- Numbers k such that k + sigma(k) + phi(k) is a triangular number.at n=37A115906
- O.g.f.: A(x) = Sum_{n>=0} x^n / Product_{k=0..n} (1 - k*(k+1)*x).at n=6A135921
- The number of unigraphical partitions of 2m; that is, the number of partitions of 2m which are realizable as the degree sequence of one and only one graph (where loops are not allowed but multiple edges are allowed).at n=30A143981
- Coefficients of numerator of recursively defined rational function: p(x,3)=x*(x^2 + 6*x + 1)/(1 - x)^4; p(x, n) = 2*x*D[p(x, n - 1), x] - p(x,n-2).at n=29A166349
- Coefficients of numerator of recursively defined rational function: p(x,3)=x*(x^2 + 6*x + 1)/(1 - x)^4; p(x, n) = 2*x*D[p(x, n - 1), x] - p(x,n-2).at n=34A166349
- Numbers n with property that 42*n+37 is in A175284.at n=9A175285
- Number of 0..n arrays x(0..7) of 8 elements with zero 6th differences.at n=9A200086
- Number of 0..3 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 4.at n=8A200464
- Number of n-bead necklaces labeled with numbers 1..n not allowing reversal, with no adjacent beads differing by more than 1.at n=9A208771
- Number of partitions of n such that the number of even parts is a part and the number of odd parts is a part.at n=42A240575
- Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 10.at n=62A245150
- O.g.f. satisfies A^2(z) = 1/(1 - z)*( BINOMIAL(BINOMIAL(A(z))) ).at n=5A258377