4305
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 8064
- Proper Divisor Sum (Aliquot Sum)
- 3759
- 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
- 1920
- Möbius Function
- 1
- Radical
- 4305
- Omega Function (Ω)
- 4
- 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
- 77
- 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
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=29A003452
- Expansion of (1-x)/( (1+x)*(1-2*x)*(1-3*x)*(1-4*x)*(1-5*x)).at n=4A004058
- a(n) = 1 + L(n) + F(2*n-1) with {L(n)}_{n>=0} the Lucas numbers (A000032) and F(2*n-1)_{n>=0} the bisected Fibonacci numbers (A001519).at n=10A005522
- Number of aperiodic binary necklaces of length n with no subsequence 00, excluding the necklace "0".at n=23A006206
- Number of free subsets of multiplicative group of GF(3^n).at n=7A007231
- Coordination sequence T2 for Zeolite Code DDR.at n=41A008072
- Coordination sequence T1 for Zeolite Code SGT.at n=41A008229
- Coordination sequence T2 for Zeolite Code VSV.at n=42A009915
- a(n) = floor(n*(n-1)*(n-2)/16).at n=42A011898
- cos(exp(x)-cos(x))=1-1/2!*x^2-6/3!*x^3-15/4!*x^4+183/6!*x^6...at n=8A013314
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 4.at n=28A013592
- q-Catalan numbers (binomial version) for q=-4.at n=3A015058
- Expansion of g.f. 1/((1 - 2*x)*(1 - 7*x)*(1 - 12*x)).at n=3A016315
- Pseudoprimes to base 83.at n=37A020211
- a(n) = n*(7*n + 1)/2.at n=35A022265
- Least modulus >= 3 having maximum run of n consecutive non-residues.at n=48A025034
- a(n) = (d(n)-r(n))/5, where d = A026057 and r is the periodic sequence with fundamental period (1,0,3,1,0).at n=43A026059
- Triangle of numbers of permutations eliminating just k cards out of n in game of Mousetrap.at n=52A028305
- 5 times triangular numbers: a(n) = 5*n*(n+1)/2.at n=41A028895
- Number of partitions of n into parts not of the form 21k, 21k+8 or 21k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=29A035986