6330
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15264
- Proper Divisor Sum (Aliquot Sum)
- 8934
- 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
- 1680
- Möbius Function
- 1
- Radical
- 6330
- Omega Function (Ω)
- 4
- 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
- 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
- Number of triangulated (n+2)-gons rooted at an exterior edge.at n=8A006078
- Expansion of 1/((1-x)(1-7x)(1-8x)(1-10x)).at n=3A024438
- a(n) = position of 3*n^2 in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).at n=45A025056
- Expansion of 1/((1-5x)(1-6x)(1-7x)(1-9x)).at n=3A028166
- T(n, k) = S(2*n + 1, n, k + 1) for 0<=k<=n and n >= 0, array S as in A050157.at n=32A050158
- T(n,k) = S(2n-1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=41A050159
- Second convolution of A001405 (central binomial numbers).at n=10A054442
- Maximal number of 132 patterns in a permutation of 1,2,...,n.at n=43A061061
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum for each group.at n=14A074128
- Successively larger 3-ball ground-state site swaps of A084501 in concatenated decimal notation.at n=30A084502
- Successively larger 3-ball indecomposable ground-state site swaps of A084511 in concatenated decimal notation.at n=15A084512
- Successively larger 3-ball 'prime' ground-state site swaps of A084521 in concatenated decimal notation.at n=14A084522
- a(n) = 7*n^2 + n.at n=30A092277
- Indices of primes in sequence defined by A(0) = 47, A(n) = 10*A(n-1) + 27 for n > 0.at n=15A101740
- Positive integers k such that k^20 + 1 is semiprime (A001358).at n=26A105282
- Rightmost diagonal of triangle A115323.at n=10A115325
- a(n) = binomial(n, floor(n/2)) - n*(n - 1)/2.at n=14A129937
- Sum of consecutives primes p and q where p == 3 mod (10) and q == 7 mod (10).at n=41A138018
- a(n) = a(n-1) + a(n-2) + digsum(a(n-1)) + digsum(a(n-2)), with a(0)=0 and a(1)=1.at n=15A140131
- Denomination sequence. Start with the 0th and first coins of value 1 cent: a(0)=a(1)=1. Thereafter a(n), the value of the n-th coin (n>=2), is the number of ways to make change for n cents in earlier coins. The two one-cent coins are considered distinct.at n=43A151945