7382
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11076
- Proper Divisor Sum (Aliquot Sum)
- 3694
- 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
- 3690
- Möbius Function
- 1
- Radical
- 7382
- 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
- 70
- 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
- Sum of (Gaussian) q-binomial coefficients for q=-4.at n=5A015155
- Numbers k such that the continued fraction for sqrt(k) has period 62.at n=31A020401
- a(n) = T(n,[ n/2 ]), where T is the array in A026268.at n=13A026297
- 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 84.at n=25A031582
- Numbers whose set of base-9 digits is {1,2}.at n=31A032930
- Numbers whose maximal base-9 run length is 4.at n=10A037999
- Number of distinct quadratic residues mod 3^n.at n=9A039300
- Numbers having four 1's in base 9.at n=5A043460
- Numbers whose base-3 representation has exactly 9 runs.at n=1A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=17A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=1A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=1A043824
- a(n) = A047848(6, n).at n=5A047854
- a(n) = (9n^2 + 9n + 4)/2.at n=40A062123
- Partial sums of A000960.at n=29A099074
- Triangle read by rows: T(n,k) (0 <= k <= ceiling(n/2)-2) is the number of (1,1) steps starting at level k in all peakless Motzkin paths of length n (can be easily translated into RNA secondary structure terminology).at n=38A110238
- a(n) = 3*A146085(n) - 1.at n=40A146087
- Number of zig-zag paths from top to bottom of a rectangle of width 8 with n rows.at n=11A153340
- G.f.: exp( Sum_{n>=1} A174466(n)*x^n/n ) where A174466(n) = Sum_{d|n} d*sigma(n/d)*tau(d).at n=14A174465
- G.f.: q-cosh(x) evaluated at q=-x.at n=36A198201