9996
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 33
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 28728
- Proper Divisor Sum (Aliquot Sum)
- 18732
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2688
- Möbius Function
- 0
- Radical
- 714
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 179
- 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
- a(n) = 7*binomial(2n,n-3)/(n+4).at n=9A000588
- 4-dimensional pyramidal numbers: a(n) = (3*n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n).at n=16A001296
- Stirling numbers of second kind S2(18,n).at n=15A011567
- a(n) = 10^n - n.at n=4A024115
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 3, with initial terms 3,1.at n=6A025230
- dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6).at n=27A026066
- Number of partitions of n into parts not of the form 17k, 17k+4 or 17k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=36A035965
- Triangle formed from even-numbered columns of triangle of expansions of powers of x in terms of Chebyshev polynomials U_n(x).at n=48A039599
- Denominators of continued fraction convergents to sqrt(39).at n=5A041065
- Denominators of continued fraction convergents to sqrt(975).at n=5A042887
- Numbers having three 9's in base 10.at n=33A043527
- Number of nonroot branch nodes in all noncrossing rooted trees on n nodes on a circle.at n=6A045737
- Numbers m such that m^2 can be obtained from m by inserting an internal block of (contiguous) digits.at n=19A045953
- Numbers k such that k^2 can be obtained from k by inserting a block of digits.at n=26A046838
- Expansion of 1/((1+x)^7 - x^7).at n=12A049018
- T(n,k)=M(2n,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.at n=48A050145
- T(n,k)=M(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.at n=38A050154
- Triangle T(n,k), k>=0 and n>=1, read by rows defined by: T(n,k) = (2k+3)*binomial(2n,n-k-1)/(n+k+2).at n=38A050155
- Triangle read by rows: T(n,k) = M(2n+1,k,-1), 0 <= k <= n, n >= 0, array M as in A050144.at n=51A050165
- Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations.at n=20A053093