6706
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 4814
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2868
- Möbius Function
- -1
- Radical
- 6706
- Omega Function (Ω)
- 3
- 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
- 44
- 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
- Number of Hamiltonian paths in a 5 X n grid starting at the lower left corner and finishing in the upper right corner.at n=8A014584
- a(n) = [ a(n-1)/a(1) + a(n-1)/a(2) + ... + a(n-1)/a(n-1) ] for n >= 3, with initial terms 2,1.at n=10A022873
- Number of partitions of n that do not contain 4 as a part.at n=34A027338
- [ exp(2/7)*n! ].at n=6A030966
- Numbers k such that 289*2^k + 1 is prime.at n=6A053361
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=26A056068
- Sum of squares of entries of Wilkinson's eigenvalue test matrix of order 2n+1.at n=21A059834
- Numbers n such that n and its reversal are both multiples of 14.at n=33A062904
- Non-palindromic number and its reversal are both multiples of 14.at n=23A062913
- Interprimes which are of the form s*prime, s=14.at n=13A075289
- Values of k such that floor(k*tanh(Pi)) = floor((k+1) tanh(Pi)).at n=24A096613
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, -1, 0), (1, 0, 1), (1, 1, 0)}.at n=7A150417
- G.f. A(x) satisfies: A(x) = x + 2*x*A(x) + 3*x^2*A(A(x)) + 4*x^3*A(A(A(x))) +...at n=6A154259
- Sums of two successive primes s such that s+-3 are primes.at n=14A179485
- Wiener index of the n-pan graph.at n=36A180861
- Third accumulation array, T, of the natural number array A000027, by antidiagonals.at n=39A185508
- Number of 8's in the last section of the set of partitions of n.at n=46A206558
- Number of representations of n as a sum of products of pairs of positive integers, n = Sum_{k=1..m} i_k*j_k with i_k<=j_k, i_k<=i_{k+1}, j_k<=j_{k+1}, i_k*j_k<=i_{k+1}*j_{k+1}.at n=29A212214
- a(n) = Sum_{0<=i<j<k<=n} L(i)*L(j)*L(k), where L(m) is the m-th Lucas number A000032(m).at n=6A213807
- Conjectured number of digits in highest power of n with no four consecutive identical digits.at n=35A216142