9676
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17640
- Proper Divisor Sum (Aliquot Sum)
- 7964
- 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
- 4640
- Möbius Function
- 0
- Radical
- 4838
- 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
- 60
- 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 bipartite partitions.at n=13A002764
- Number of triangular cacti with 2n+1 nodes (n triangles).at n=12A003081
- Number of partitions of n into divisors of n.at n=47A018818
- Expansion of e.g.f.: tan(tan(x))*sin(x)/2.at n=4A024278
- Indices of prime Fibonacci numbers, minus 1.at n=25A069744
- k such that k-th prime is of the form 2n^2 + 3n + 3.at n=34A096690
- Number of Catalan knight paths from (0,0) to (n,2) in the region between and on the lines y=0 and y=3. (See A096587 for the definition of Catalan knight.).at n=18A099330
- Positive integers n such that n^11 + 1 is semiprime.at n=43A105122
- a(n) = (10^k - n)(10^k + n), where k is the number of digits in n.at n=17A110397
- Number of parts that are multiples of 3 in all partitions of n.at n=30A116635
- Number of base 32 n-digit numbers with adjacent digits differing by three or less.at n=4A126500
- a(n) = 5*n^2 + 10*n + 1. Coefficients of the rational part of (1 + sqrt(n))^5.at n=43A134593
- a(n) = 225*n^2 - 199*n + 44.at n=7A156812
- a(n) = 225*n + 1.at n=42A158229
- Numbers n such that |2^n-16257| is prime.at n=50A165780
- Let S be the set of positive integers that, when written in binary, exist as substrings in the binary representation of n. a(n) = number of partitions of n into parts that are all members of S. Each part may occur any number of times in a partition.at n=47A175359
- Triangle, read by rows, T(n, k) = 1 - floor(n*(n-1)/4) + floor(binomial(n-1,k-1) * binomial(n, k-1)/(2*k)).at n=40A176125
- Triangle T(n,k) read by rows: T(n,k) is the number of compositions of n with k parts p at position p (fixed points), n>=0, 0<=k<=A003056(n).at n=61A238350
- Number of compositions p(1)+p(2)+...+p(k) = n such that for no part p(i) = i (compositions without fixed points).at n=16A238351
- Number of trees on n vertices with an even number of leaves.at n=16A262430