7684
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
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14364
- Proper Divisor Sum (Aliquot Sum)
- 6680
- 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
- 3584
- Möbius Function
- 0
- Radical
- 3842
- Omega Function (Ω)
- 4
- 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
- 145
- 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
- yes
- Odd
- no
Appears in sequences
- sec(sinh(x)+log(x+1))=1+4/2!*x^2-6/3!*x^3+107/4!*x^4-490/5!*x^5...at n=6A013023
- Number of ordered quadruples of integers from [ 2,n ] with no common factors between triples.at n=22A015639
- Numbers k such that phi(k) + 7 | sigma(k).at n=4A015798
- Discriminants of quintic fields with 4 complex conjugates.at n=47A023685
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=40A024846
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=32A025001
- Least k>1 such that reverse of first n terms of A022303 repeats beginning at k-th term.at n=49A025520
- a(n) = 2^(n-1)*(4*n-6) + 4.at n=9A048497
- Moebius transform of A000029 (starting at term 0).at n=18A054156
- Average of terms of n-th row of A077321.at n=35A077325
- Number of classes of compositions of n equivalent under reflection or cycling.at n=17A091696
- Expansion of q^(-1/3) * eta(q^6)^2 / (eta(q) * eta(q^3)) in powers of q.at n=29A097197
- Numbers k such that 10^k + 3*R_k + 4 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=17A102932
- Number of degeneracies on the sets of n ordinary trees with n vertices. These are the values of the Schultz molecular topological index, MTI, in Table 15 of the paper by Elena V. Konstantinova and Maxim V. Vidyuk.at n=7A125069
- (Sum of the squares of the quadratic nonresidues of prime(n)) / prime(n).at n=43A125618
- 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, 0, 0), (0, -1, 0), (1, 1, -1), (1, 1, 1)}.at n=8A149428
- 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, 0), (-1, 0, 1), (0, 0, 1), (1, 0, -1), (1, 1, 0)}.at n=7A150485
- G.f.: Sum_{n>=0} a(n)*x^n/2^(n^2+n) = exp( Sum_{n>=1} x^n/[n*2^(n^2)] ).at n=4A165940
- Numbers k such that k^3 divides 15^(k^2) - 1.at n=32A177915
- 1/8 the number of (n+1)X2 0..3 arrays with all 2X2 subblock sums the same.at n=5A184021