7436
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
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 15372
- Proper Divisor Sum (Aliquot Sum)
- 7936
- 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
- 3120
- Möbius Function
- 0
- Radical
- 286
- Omega Function (Ω)
- 5
- 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
- 132
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Least positive unitary linear combination of distinct numbers in row n of Pascal's triangle; i.e., least positive sum of form d(0)C(n-1,0) + d(1)C(n-1,1) + ...+ d(m)C(n-1,m), d(i)=+-1, m = floor((n+1)/2).at n=27A004795
- Robbins numbers: a(n) = Product_{k=0..n-1} (3k+1)!/(n+k)!; also the number of descending plane partitions whose parts do not exceed n; also the number of n X n alternating sign matrices (ASM's).at n=6A005130
- Reverse and Add! sequence starting with 196.at n=3A006960
- Coordination sequence for Ni2In, Position Ni2.at n=26A009942
- Number of achiral hexagonal polyominoes with n cells.at n=13A030225
- Number of reversible strings with n-1 beads of 2 colors. 4 beads are black. String is not palindromic.at n=21A032091
- a(n) = 11*n^2.at n=26A033584
- Multiplicity of highest weight (or singular) vectors associated with character chi_4 of Monster module.at n=47A034392
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 4).at n=42A035545
- Number of partitions of n into parts 3k+1 and 3k+2 with at least one part of each type.at n=41A035620
- Number of partitions of n into parts not of the form 19k, 19k+4 or 19k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=34A035973
- Number of partitions of n such that cn(0,5) = cn(1,5) = cn(3,5) < cn(2,5) = cn(4,5).at n=76A036869
- Triangle read by rows: T(n,k) = number of 2 X inf arrays [ n, n1, n2, ...; k, k1, k2,... ] with n>=n1>n2>...>=0, k>=k1>k2...>=0, n>k, n1>k1, ...; n >= 1, k >= 0. Note that once ni or ki = 0, the strict inequalities become equalities (constant 0 thereafter).at n=40A039597
- Numbers whose base-3 representation has exactly 9 runs.at n=13A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=29A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=13A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=13A043824
- Robbins triangle read by rows: T(n,k) = number of alternating sign n X n matrices with a 1 at top of column k (n >= 1, 1<=k<=n).at n=27A048601
- Robbins triangle read by rows: T(n,k) = number of alternating sign n X n matrices with a 1 at top of column k (n >= 1, 1<=k<=n).at n=21A048601
- Partial sums of A007587.at n=10A051799