6944
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 16128
- Proper Divisor Sum (Aliquot Sum)
- 9184
- 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
- 2880
- Möbius Function
- 0
- Radical
- 434
- Omega Function (Ω)
- 7
- 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
- 31
- 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
- Bisection of A002470.at n=11A002287
- Glaisher's function W(n).at n=22A002470
- Number of degree sequences of n-node graphs.at n=6A005155
- Number of ordered quadruples of integers from [ 2,n ] with no common factors between triples.at n=21A015639
- Theta series of A*_7 lattice. Expansion of F_8(q^2).at n=79A023919
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=29A026054
- 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 41.at n=27A031539
- a(n) = a(n-1) + a(m) for n >= 3, 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) = 1 and a(2) = 2.at n=45A050049
- Jordan function J_3(n).at n=19A059376
- Number of 4-block ordered tricoverings of an unlabeled n-set.at n=30A060488
- Numbers k such that sigma(x) = k has exactly 6 solutions.at n=32A060662
- Stirling interpolation of f'(x) by (2n+1)-st differences.at n=5A061027
- Third binomial transform of binomial(n+3, 3).at n=5A081896
- Every integer can be represented uniquely as m = k*2^(j+1)+2^j-1. Sequence gives values of k for m = repunit(n).at n=5A086223
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).at n=12A090789
- Even numbers n such that N(n) is divisible by a nontrivial square, say m^2 with gcd(n,m) = 1, where N(n) is the numerator of the Bernoulli number B(n). The smallest numbers m are given in A094095.at n=12A090943
- XOR difference triangle of the powers of 3, read by rows.at n=42A099887
- Let b(0)=1/2, b(n) = b(n-1) + Prime[n]/2; a(n)=b(2*n).at n=38A112039
- Sum of the sizes of the Durfee squares of all partitions of n.at n=26A115995
- Corresponding values of arithmetic means of divisors of numbers from A007340.at n=18A157848