4668
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10920
- Proper Divisor Sum (Aliquot Sum)
- 6252
- 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
- 1552
- Möbius Function
- 0
- Radical
- 2334
- Omega Function (Ω)
- 4
- 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
- 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
- Coordination sequence T1 for Zeolite Code MEL.at n=44A008150
- Coordination sequence T4 for Zeolite Code RUT.at n=45A009900
- a(n) is nonsquarefree and is sum of first k nonsquarefrees for some k.at n=26A013935
- Powers of fifth root of 12 rounded down.at n=17A018147
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 34.at n=37A031532
- Coordination sequence T4 for Zeolite Code CFI.at n=45A033602
- Number of partitions satisfying cn(2,5) <= 1 and cn(3,5) <= 1.at n=36A039855
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=47A050029
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=29A052477
- Numbers k such that 3*2^k - 5 is prime.at n=30A057912
- a(n) is the smallest value of m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.at n=11A064022
- Interprimes which are of the form s*prime, s=12.at n=16A075287
- Mean (rounded) of primes below 10^n.at n=3A092800
- Consider the family of multigraphs enriched by the species of linear order. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those multigraphs on n edges, arcs and loops.at n=15A098288
- The present sequence depends on the index k of a Gaussian prime a + bi in A103431. Such an index k is a term of this sequence when an integer multiplier m exists such that m*norm(a+bi) lies in an interval of length 1 around the index k of a+bi in A103431: k - 1/2 < m*norm(a+bi) < k + 1/2.at n=48A107629
- A Chebyshev-related transform of the Jacobsthal numbers.at n=11A112577
- Numbers n such that first occurrence of the 10 digits of the i-th root of n contain all the digits from 0 to 9.at n=19A119521
- Expansion of Sum_{k>=0} x^(k^2+k)/((1-x)(1-x^2)...(1-x^(2k))).at n=47A122134
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=19A124140
- Limit of reversed rows of triangle A126470, in which row sums equal the factorials.at n=16A126471