6344
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 13020
- Proper Divisor Sum (Aliquot Sum)
- 6676
- 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
- 1586
- Omega Function (Ω)
- 5
- 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
- 80
- Smith Number
- yes
- 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
- Molien series for 6-dimensional complex reflection group 4.U_4 (3) of order 2^9 .3^7 .5.7.at n=47A008581
- 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 39.at n=25A031537
- Sum of reciprocals of digits = 1.at n=34A037268
- Deepest position in the deck reached by card 1 before returning to the top in the shuffle in A035485 and A035499.at n=6A057974
- Harmonic mean of digits is 4.at n=36A062182
- Let r, s, t be three permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i).at n=16A070735
- Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).at n=10A071861
- Numbers k such that 10^k + 7 is prime.at n=16A088274
- Poincaré series [or Poincare series] (or Molien series) for a certain four-fold wreath product P_4.at n=41A091434
- Numbers which are the sum of two positive cubes and divisible by 13.at n=31A094447
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having height of the first peak equal to k.at n=33A108437
- Numbers k such that the sum of the first k primes is prime and the sum of the squares of the first k primes is also prime.at n=28A124225
- a(n) = Sum_{1<=k<=n, gcd(k,n)=1}, A000217(k).at n=47A127415
- Number of partitions of n into "number of partitions of n into 'number of partitions of n into partition numbers' numbers" numbers.at n=46A130899
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 6.at n=15A136883
- Partial sums of round(n^2/6).at n=48A173691
- First of two consecutive numbers with at least one 3 in their prime signature.at n=29A176313
- Number of paths from (0,0) to (n,n) avoiding 4 or more consecutive east steps and 4 or more consecutive north steps.at n=8A177792
- Number of n-game win/loss series that contain at least one dead game.at n=12A180967
- Number of 3-step self-avoiding walks on an n X n square summed over all starting positions.at n=23A188148