6324
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 16128
- Proper Divisor Sum (Aliquot Sum)
- 9804
- 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
- 1920
- Möbius Function
- 0
- Radical
- 3162
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 80
- 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
- G.f.: (1 + x^3 + x^4 + ... + x^12 + x^15)/Product_{i=1..10} (1 - x^i).at n=26A003403
- a(n) = Sum_{i,j,k in Z and i^2 + j^2 + k^2 <= n} i^2 + j^2 + k^2.at n=23A014203
- a(n) = Sum_{i,j,k in Z and i^2 + j^2 + k^2 <= n} i^2 + j^2 + k^2.at n=22A014203
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 5).at n=57A035582
- Number of partitions of n into parts not of the form 25k, 25k+5 or 25k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=32A036004
- Schoenheim bound L_1(n,5,4).at n=26A036832
- Numbers whose base-3 representation contains exactly four 0's and four 2's.at n=31A045013
- Triangle of rooted planar maps.at n=39A046651
- If n mod 2 = 0 then m := n/2 and a(n) = (3*m)!*(5*m+1)/((m+1)!*(2*m+1)!); otherwise m := (n-1)/2, a(n) = 6*(3*m+2)!/(m!*(2*m+3)!).at n=12A047750
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-2)/3.at n=33A048026
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-3)/3.at n=33A048037
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.at n=40A050775
- Generalized Catalan array FS(3; n,r).at n=60A062745
- Numbers n such that determinant[{{n,phi(n)},{n+1,phi(n+1)}}]is a perfect square.at n=11A067571
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A006013(n), a(n+1,n)=A001764(n+1), a(n,m) = Sum A001764(n-k)*a(n,k), k=0..m.at n=26A073148
- Triangle read by rows: T(n,k) is the number of nonseparable planar maps with r*n edges and a fixed outer face of r*k edges which are invariant under a rotation of 1/r for any r >= 2 (independent of actual value of r).at n=41A091599
- Fifth column of the (1,4)-Pascal triangle A095666.at n=15A095667
- Take pairs (a, b), sorted on a, such that T(a)+T(b)=concatenation of a and b, where T(k) is the k-th triangular number A000217(k). Sequence gives values of a.at n=15A096031
- Start to read the sequence digit by digit and erase the first "1" you encounter, then the first "2", the first "3", etc., until the first "9"; go on from there and erase again the first "1", the first "2", etc., until "9" -- and so on, cyclically until the end of the (infinite) sequence. Concatenate what is left. The result is the concatenation of all integers of the sequence.at n=8A108709
- Numbers k such that k^2 + 11 and k^2 + 13 are primes.at n=26A113537