7194
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
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 8646
- 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
- 2160
- Möbius Function
- 1
- Radical
- 7194
- 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
- 119
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=47A050061
- a(n) = 3*(n - 2)*(5*n -11).at n=22A060785
- Prime(n^2) +/- n are primes.at n=24A064495
- Number of partitions of n into an equal number of prime and composite parts.at n=57A116449
- Positions of those 1's that are followed by a 0, summed over all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.at n=11A152881
- Concatenation of odd n and even n-th nonprime.at n=24A155486
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-1,0,1,2}, n=3*r+p_i, and define a(-1)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,2,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^3-2*x) with x=2*cos(Pi/9).at n=30A187504
- Number of (n+2) X 4 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=13A202441
- Vinogradov's constants arising in enumeration of solutions to Waring's problem in the evil numbers (A001969).at n=18A206375
- (A209982)/2.at n=38A209983
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210755; see the Formula section.at n=47A210756
- Least number k such that n*k^n +/- 1 are twin primes, or a(n) = 0 if no such number exists.at n=12A239735
- Number of partitions p of n such that m(p) = m(c(p)), where m = maximal multiplicity of parts, and c = conjugate.at n=44A240728
- Expansion of Product_{k>=1} 1/(1-x^k)^(k*(k-1)*(k-2)).at n=10A258351
- Total length of self-avoiding walks with n bonds on the simple cubic lattice with additional bridges of length 2.at n=4A259820
- a(n) = number of steps to reach 0 when starting from k = n^3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=39A261227
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 126", based on the 5-celled von Neumann neighborhood.at n=27A270215
- "3-Portolan numbers": number of regions formed by n-secting the angles of an equilateral triangle.at n=49A277402
- Number of nonagons that can be formed with perimeter n.at n=36A288255
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^7)).at n=27A288342