4372
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7658
- Proper Divisor Sum (Aliquot Sum)
- 3286
- 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
- 2184
- Möbius Function
- 0
- Radical
- 2186
- Omega Function (Ω)
- 3
- 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
- 33
- 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
- McKay-Thompson series of class 2A for the Monster group with a(0) = 24.at n=2A007241
- Expansion of 16 * (1 + k^2)^4 /(k * k'^2)^2 in powers of q where k is the Jacobian elliptic modulus, k' the complementary modulus and q is the nome.at n=2A007267
- Coordination sequence T2 for Zeolite Code MFS.at n=41A008174
- Coordination sequence T7 for Zeolite Code MFS.at n=41A008179
- Coordination sequence T8 for Zeolite Code MFS.at n=41A008180
- Numbers with exactly 6 2's in their ternary expansion.at n=27A023704
- a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2).at n=21A026037
- Number of partitions of n into an odd number of parts, the least being 4; also, a(n+4) = number of partitions of n into an even number of parts, each >=4.at n=61A027190
- Numbers whose set of base-16 digits is {1,4}.at n=15A032828
- Number of partitions of n into parts 5k+1 or 5k+2.at n=55A035371
- Number of partitions of n such that cn(1,5) <= cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5).at n=70A036852
- Sums of 4 distinct powers of 4.at n=21A038472
- a(n) = (9*n^2 + 3*n + 2)/2.at n=31A038764
- Numbers whose base-4 representation contains exactly three 0's and four 1's.at n=6A045032
- Numbers whose base-5 representation contains exactly two 1's and three 4's.at n=24A045258
- McKay-Thompson series of class 2A for Monster.at n=2A045478
- Smallest palindrome greater than n in bases n and n+1.at n=44A048268
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=13A049924
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=12A049962
- a(n) = T(n,n-4), array T as in A055818.at n=13A055821