7706
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11562
- Proper Divisor Sum (Aliquot Sum)
- 3856
- 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
- 3852
- Möbius Function
- 1
- Radical
- 7706
- 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
- 52
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for FeS2-Marcasite, Fe position.at n=43A009955
- Numbers k such that the continued fraction for sqrt(k) has period 39.at n=11A020378
- Number of partitions in parts not of the form 25k, 25k+3 or 25k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=35A036002
- Number of base-2 Euler-Jacobi pseudoprimes (A047713) less than 10^n.at n=9A055551
- a(n) = Sum_{k=1..n} d(k)*prime(k), where d(k) = A001223.at n=29A064009
- Molien series for group of order 4608 acting on joint weight enumerators of a pair of binary doubly-even self-dual codes.at n=37A097870
- Conjectured numbers n such that the trajectory of n as defined in A003508 is unique.at n=32A105233
- Number of binary strings of length n with no substrings equal to 0000, 0001, or 0110.at n=16A164411
- a(n) = n*(9*n + 25)/2 + 6.at n=40A235332
- Number of n X 3 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=17A240790
- Expansion of Product_{k>=1} (1+x^k)^(k*(k+1)).at n=9A258341
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 286", based on the 5-celled von Neumann neighborhood.at n=27A271123
- Row sums of A283838.at n=14A283839
- Number of nX6 0..1 arrays with every element unequal to 2 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=7A303634
- Number of compositions (ordered partitions) of n into distinct parts, the least being 2.at n=31A339163
- For 1<=x<=n, 1<=y<=n with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = m^2*s, where s is the population variance of the values of v and m is the number of such values.at n=8A345693
- Squarefree semiprimes (products of two distinct primes) between sphenic numbers (products of three distinct primes).at n=18A362507
- Number of incomplete integer partitions of n, meaning not every number from 0 to n is the sum of some submultiset.at n=38A365924
- Irregular table read by rows: T(n,k) is the number of k-sided regions, k>=3, in the hyperoctahedral (or cocktail party) graph of order n.at n=51A368758
- Number of Carlitz compositions of n (see A003242) such that the first and last parts are equal.at n=20A373420