7338
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
- 14688
- Proper Divisor Sum (Aliquot Sum)
- 7350
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2444
- Möbius Function
- -1
- Radical
- 7338
- 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
- 39
- 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) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=24A000070
- Fine's sequence (or Fine numbers): number of relations of valence >= 1 on an n-set; also number of ordered rooted trees with n nodes having root of even degree.at n=11A000957
- Number of equivalence classes of binary sequences of primitive period n.at n=19A002730
- Convolution of natural numbers >= 3 and (Fib(2), Fib(3), Fib(4), ...).at n=13A023554
- Number of palindromic partitions of n.at n=48A025065
- Number of palindromic partitions of n.at n=49A025065
- a(n) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=30A025193
- Numbers whose base-5 representation contains exactly two 2's and three 3's.at n=26A045273
- a(n) = Sum_{i=1..n} T(i,n-i), where T is A049615.at n=45A049616
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 4 leaves.at n=11A055365
- Number of primitive (period n) step cyclic shifted sequences using exactly two different symbols.at n=19A056424
- Generalized Catalan numbers C(-1; n).at n=11A064310
- Triangle T(n,k) giving number of Dyck paths of length 2n with exactly k hills (0 <= k <= n).at n=55A065600
- Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k.at n=46A065602
- a(n) = Sum_{k=1..n} antisigma(k), where antisigma(i) = sum of the nondivisors of i that are between 1 and i.at n=35A076664
- Difference between the arithmetic mean of the neighbors of the terms and the term itself follows the pattern 0,1,2,3,4,5,...at n=29A086514
- Triangle read by rows: a(n,k) = number of Dyck n-paths such that number of DUs at level 1 plus number of UDs at level 2 is k, 0<=k<=n-1.at n=55A096794
- Number of partitions of n with at most one odd part.at n=49A100824
- Number of partitions of n with at most 2 odd parts.at n=49A100835
- Expansion of (1-2*x-sqrt(1-4*x))/(x^2 * (1+2*x+sqrt(1-4*x))).at n=8A104629