6894
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 8082
- 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
- 2292
- Möbius Function
- 0
- Radical
- 2298
- 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
- 57
- 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
- a(0) = a(1) = 1; for n > 1, a(n) = n*a(n-1) + (-1)^n.at n=7A001120
- Number of hierarchical models on n labeled factors or variables with linear terms forced. Also number of antichain covers of a labeled n-set.at n=5A006126
- a(n) = Sum_{k = 1..n} k*floor((n + prime(k))/k).at n=49A024929
- 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=47A025056
- a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2.at n=40A027575
- Number of ternary rooted trees with n nodes and height at most 6.at n=14A036374
- Numbers whose base-4 representation contains exactly four 2's and two 3's.at n=19A045155
- Number of primes between n^4 and (n+1)^4.at n=28A061235
- a(n) = Sum_{ r = 0 to n} L(n,r), where L(n,r) (A067049) = lcm(n, n-1, n-2, ..., n-r+1)/lcm(1, 2, 3, ..., r).at n=14A061297
- Numbers which are the sum of three cubes of distinct primes.at n=30A138854
- Triangle T(n,k) = A000142(n-k)*A003319(k+1) read by rows.at n=42A141476
- Numbers m such that A006218(m) is a perfect square.at n=26A175345
- a(n) = 3*a(n-1) - 2*a(n-2) with a(0)=36 and a(1)=90.at n=7A182467
- G.f.: q-sinh(x) evaluated at q=-x.at n=32A198202
- G.f. satisfies: A(x) = (1 + x*A(x)^3) * (1 + x^2*A(x)^6).at n=6A200731
- Smallest m such that A070965(m) = n.at n=27A227953
- a(n) = n*a(n-1) + (-1)^n for n>0, a(0)=2.at n=7A236438
- Sum of squares of end-to-end distances for self-avoiding walks on the Manhattan lattice.at n=9A260777
- Array of coefficients A(n,k) of the formal power series P(n,x) read by upwards antidiagonals, where P(n,x) = Sum_{k>=0} A(n,k)*x^k = 1 + x*P(n,x)^(1*n) + x^2*P(n,x)^(2*n) + x^3*P(n,x)^(3*n) for n >= 0.at n=51A262082
- Numbers n such that Bernoulli number B_{n} has denominator 798.at n=25A272138