8733
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 3363
- 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
- 5600
- Möbius Function
- -1
- Radical
- 8733
- 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
- 140
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 4*a(n-1) - a(n-2), with a(0) = 0, a(1) = 3.at n=7A005320
- Number of partitions of n with equal nonzero number of parts congruent to each of 2 and 4 (mod 5).at n=44A035570
- Numerators of continued fraction convergents to sqrt(12).at n=6A041016
- Larger members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=27A054572
- Numbers k such that (-k!! + (k+1)!! + 1)/2 is prime.at n=13A076210
- a(n) = 4*a(n-2) - a(n-4).at n=13A083336
- Triangle T(n,k) defined by: T(0,0)=1, T(n,k)=0 if k < 0 or k > n, T(n,k) = T(n-1,k-1) + k*T(n-1,k) + Sum_{j>=1} T(n-1,k+j).at n=50A116155
- Expansion of (1-x)*(2*x^2-4*x+1)/(1-2*x+5*x^2-4*x^3+x^4).at n=13A131039
- Numerators of principal and intermediate convergents to 3^(1/2).at n=20A143642
- Numerators of the lower principal convergents and the lower intermediate convergents to 3^(1/2).at n=13A143643
- Number of ways to place zero or more nonadjacent 1,0 2,1 2,2 3,1 3,3 4,2 4,3 5,4 polyhexes in any orientation on a planar nXnXn triangular grid.at n=8A155445
- Number of ways to arrange 6 indistinguishable points on an n X n X n triangular grid so that no three points are in the same row or diagonal.at n=5A194478
- T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no three points are in the same row or diagonal.at n=60A194480
- Number of (w,x,y,z) with all terms in {1,...,n} and w^2>=x*y*z.at n=15A212064
- Array A(n,k) with all numbers m such that 3*m^2 +- 3^k is a square and their corresponding square roots, read by downward antidiagonals.at n=52A227418
- a(n) = n for n = 1, 2, 3; for n > 3: a(n) = number of partitions of n into preceding terms.at n=47A229362
- List of triples (r,s,t): the matrix M = [[4,12,9][2,7,6][1,4,4]] is raised to successive powers, then (r,s,t) are the square roots of M[3,1], M[1,1], M[1,3] respectively.at n=23A249578
- Numerators of the other-side convergents to sqrt(3).at n=13A259593
- The number of links of a qualifying "snake" polyline that connects the midpoints of opposite sides of the n-th regular integer hexagon that allows such a construction.at n=7A356047
- a(n) = Sum_{k=0..floor(n/4)} Stirling2(n - 3*k,n - 4*k).at n=19A357926