9908
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
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17346
- Proper Divisor Sum (Aliquot Sum)
- 7438
- 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
- 4952
- Möbius Function
- 0
- Radical
- 4954
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- Number of two-rowed partitions of length 3.at n=37A001993
- Number of strictly 2-dimensional fixed polyominoes with n cells.at n=8A006762
- a(n) = Sum_{k=0..7} binomial(n,k).at n=14A008860
- a(n) = 2^(n-1) + ((1 + (-1)^n)/4)*binomial(n, n/2).at n=14A027306
- a(n) = Sum_{i=0..n} binomial(2*n, i).at n=7A032443
- a(n) = 2^n - C(n,0) - C(n,1) - ... - C(n,6).at n=14A035039
- Least number which may be expressed as the sum of a prime number and a nonzero square in exactly n different ways.at n=35A064283
- Treated as strings, n begins with Floor(sqrt(n)).at n=31A069086
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.at n=14A088066
- Number of times the digit 2 appears in the first 10^n digits of Pi.at n=4A099293
- Riordan array (1/((1-4*x)*c(x)),x*c(x)/sqrt(1-4*x)), c(x) the g.f. of A000108.at n=28A113955
- Expansion of ((1 + x - 2x^2) + (1+x)*sqrt(1-4x^2))/(2(1-4x^2)).at n=15A116406
- Triangle, read by rows, where the g.f. of column k, C_k(x), is equal to the product: C_k(x) = Product_{k=0..n} 1/(1 - binomial(n,k)*x).at n=52A124834
- Triangle T(n, k) = Sum_{j=0..n} (2*n)!/((2*n-k-j)!*j!*k!), read by rows.at n=28A141723
- Expansion of g.f.: 1/((1 - 2*x^2 + x^4 + 2*x^6 - x^8)*(1 - 2*x^2 - x^4 + 2*x^6 - x^8)).at n=22A147607
- Expansion of x*(1 + x^2 - x^3) / ( (1-x)*(1-x-x^4) ).at n=27A168639
- Triangle read by rows: DX(n,d) = number of properly d-dimensional polyominoes with n cells, modulo translations (n>=1, 0 <= d <= n-1).at n=38A195739
- Number of binary arrays of length n+13 with no more than 7 ones in any length 14 subsequence (=50% duty cycle).at n=0A212401
- T(n,k)=Number of binary arrays of length n+2*k-1 with no more than k ones in any length 2k subsequence (=50% duty cycle).at n=21A212402
- Number of placements of brackets in a monomial of degree n in an algebra with two commutative multiplications.at n=8A226909