7709
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8316
- Proper Divisor Sum (Aliquot Sum)
- 607
- 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
- 7104
- Möbius Function
- 1
- Radical
- 7709
- 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
- no
- Odd
- yes
Appears in sequences
- Pseudoprimes to base 77.at n=33A020205
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 14 (most significant digit on right).at n=18A029507
- Expansion of (1+x^3*C^3)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=7A071737
- Number of permutations satisfying -k <= p(i)-i <= r and p(i)-i not in I, i=1..n, with k=1, r=5, I={1}.at n=18A079816
- Duplicate of A079816.at n=18A079970
- Diagonal of triangular spiral in A051682.at n=41A081267
- a(1) = 10; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=40A111524
- Number of 5-almost primes 5ap such that 2^n < 5ap <= 2^(n+1).at n=16A120036
- Binomial transform of [1, 3, 7, 0, 0, 0, ...].at n=47A140063
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, 1, -1)}.at n=8A149003
- (2^p-(p+2))/p as p runs through the primes.at n=6A164740
- Numbers k such that 3^k + 3*k + 1 is prime.at n=15A171058
- Number of Lyndon words appearing as n-th degree terms in Baker-Campbell-Hausdorff series.at n=17A220587
- Number of length n+4 0..6 arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=6A249654
- Number of length 7+4 0..n arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=5A249663
- Number of 3-generalized Motzkin paths of length n with no level steps H=(3,0) at even level.at n=18A257516
- a(0)=1; for n >= 1, a(n) is the number of subsets of [a(0), a(1), ..., a(n-1)] whose sum is equal to a(n-1).at n=27A265853
- Triangle of coefficients of Gaussian polynomials [2n+5,5]_q represented as finite sum of terms (1+q^2)^k*q^(g-k), where k = 0,1,...,g with g=5n.at n=63A267485
- Number of nX3 0..1 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=6A279163
- Number of nX7 0..1 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=2A279167