9674
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16608
- Proper Divisor Sum (Aliquot Sum)
- 6934
- 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
- 4140
- Möbius Function
- -1
- Radical
- 9674
- 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
- 60
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (composite numbers).at n=23A025081
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 5).at n=46A035552
- Expansion of e.g.f. (-1 + sqrt(1 + 4*log(1-x)))/(2*log(1-x)).at n=5A052803
- The next square after a(n)^3 is a(n+1)^2.at n=7A059842
- Numbers n such that the numerator of BernoulliB[n] is divisible by 691.at n=34A119864
- a(1)=2; a(n)=floor((13+sum(a(1) to a(n-1)))/6).at n=56A120179
- a(1)=1, a(n) = a(n-1) + n^4 if n odd, a(n) = a(n-1) + n^0 if n is even.at n=9A140157
- a(n) = 343*n - 273.at n=28A157369
- a(n) = 225*n - 1.at n=42A158227
- Number of values of k for which sigma(k)-k is a permutation of decimal digits of k, for k < 2^n.at n=26A216393
- Number of primes p such that sqrt(q) - sqrt(p) > 1/n, where q is the prime after p.at n=40A218015
- Number of nX3 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nX3 array.at n=4A219709
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array.at n=25A219714
- Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 5Xn array.at n=2A219718
- Number of trapezoidal words of length n.at n=39A260881
- a(n) is the number of triangles (up to congruence) with integer coordinates that have perimeter strictly less than n.at n=34A298121
- Number of compositions (ordered partitions) of n into distinct parts such that number of parts is even.at n=27A332305
- G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies: [Sum_{n>=0} x^n/(1 - x^(n+1))]^4 = Sum_{n>=0} a(n)*x^n/(1 - x^(n+1))^4.at n=12A341375
- a(n) is the first even number k such that there are exactly n pairs (p,q) where p and q are prime, p<=q, p+q = k, and p+A001414(k) and q+A001414(k) are also prime.at n=44A357816
- Consecutive internal states of the linear congruential pseudo-random number generator (321*s + 123) mod 10^5 when started at 1.at n=11A383128