6042
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
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 6918
- 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
- 1872
- Möbius Function
- 1
- Radical
- 6042
- 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
- 67
- 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
- Expansion of (1/theta_4(q)^2 -1)/4 in powers of q.at n=12A002318
- a(n) = [ a(n-1)/a(1) ] + [ a(n-1)/a(2) ] + ... + [ a(n-1)/a(n-1) ] for n >= 3, with initial terms 1,1.at n=10A022855
- a(n) = (d(n)-r(n))/5, where d = A026057 and r is the periodic sequence with fundamental period (1,0,3,1,0).at n=49A026059
- Coefficients of cluster series for site percolation problem on triangular lattice with 1st, 2nd and 3rd neighbor bonds.at n=4A036397
- Number of partitions of 5n such that cn(0,5) = cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).at n=11A036884
- (s(n)+1)/9, where s(n)=n-th base 9 palindrome that starts with 8.at n=43A043079
- Triangle of number of falls in set partitions of n.at n=39A056859
- McKay-Thompson series of class 40C for Monster.at n=42A058664
- Sum of distinct orders of degree-n even permutations.at n=21A060180
- a(n) = Sum_{k=0..n} S(k), where S(n) are the tribonacci generalized numbers A001644.at n=13A073728
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=2, a(2)=3.at n=14A079116
- Numbers k such that for any positive integers (a, b), if a * b = k then a + b is prime.at n=58A080715
- a(n) = Sum_{k=0..floor(n/6)} binomial(n-3k,3k).at n=21A100134
- Numbers n such that A001414(n) is a golden semiprime, where A001414 is the sum of primes dividing n (with repetition).at n=40A108219
- For each positive integer n, consider the ternary sequence given initially by x(i) = 0 if 1 <= i < n, x(n) = 1; and thereafter determined by the quadratic recurrence x(i) = x(i-1) + x(i-n)^2 mod 3. Define a(n) to be the smallest positive integer N for which x(N+i) = x(i) for all sufficiently large i.at n=55A112683
- Lower level digraph derived from a voltage graph.at n=22A115055
- Numbers that have an "a" in the middle of their names in Spanish.at n=28A160775
- Number of four-prime Carmichael numbers less than 10^n.at n=14A174612
- a(n) = 6*(24*n - 1).at n=41A187206
- Dispersion of A047215, (numbers >1 and congruent to 0 or 2 mod 5), by antidiagonals.at n=57A191723