4694
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7044
- Proper Divisor Sum (Aliquot Sum)
- 2350
- 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
- 2346
- Möbius Function
- 1
- Radical
- 4694
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 108
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of Twopins positions.at n=22A005691
- Coordination sequence T1 for Zeolite Code DDR.at n=43A008071
- Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among quadruples.at n=12A015653
- Numbers k such that the continued fraction for sqrt(k) has period 66.at n=13A020405
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 68.at n=3A031566
- Number of partitions satisfying cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5).at n=31A039837
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=21A045107
- Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.at n=17A065511
- Right-truncatable semiprimes.at n=41A085733
- (-1) times minimal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n).at n=57A086394
- Two-sided semiprimes: deleting any number of digits at left or at right, but not both, leaves a semiprime.at n=14A086698
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n containing k subwords of the type U H^j U or D H^j D for some j>0, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=37A097100
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k subwords of the type uh^ju, dH^jd, or dh^ju for some j>0, where u=(1,1), d=(1,-1) and h=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=38A098056
- Maximum determinant that can be formed from the optimal set of nonnegative 3 X 3 matrix elements <=n, which maximize the number of different determinants given in A099834.at n=16A099815
- Semiprimes with semiprime digits (digits 4, 6, 9 only).at n=19A107342
- a(n) = 4694*a(n-2) + 9380*a(n-3) for n >= 3 with a(0) = 0 and a(1) = a(2) = 1.at n=3A114568
- a(n)= 4*a(n-1) +18*a(n-2) -48*a(n-3) -60*a(n-4) +80*a(n-5) +56*a(n-6).at n=2A121800
- Minimal isotopy classes of Latin trades of size n.at n=14A133170
- Similar to A072921 but starting with 4.at n=29A152233
- a(n) = 361*n + 1.at n=12A158310