6704
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
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 13020
- Proper Divisor Sum (Aliquot Sum)
- 6316
- 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
- 3344
- Möbius Function
- 0
- Radical
- 838
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 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
- Number of tree-like polyhexes rooted at a hexagon and containing n hexagons.at n=7A002213
- Probable extension of A013704.at n=16A025495
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049727.at n=41A049739
- A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct.at n=17A096772
- Least positive integer that can be represented as the sum of a prime and a triangular number in exactly n ways.at n=44A101182
- Indices of Fibonacci numbers in A073656, i.e., A073656(n) = F(a(n)).at n=13A119755
- Molecular topological indices of the path graphs P_n.at n=21A121318
- Numbers n such that n^4+1 and n^4+3 are twin primes.at n=43A127871
- Number of 2 X 2 singular integer matrices with elements from {1,...,n}.at n=40A134506
- Product(1 + a(n)*x^n, n=1..infinity) = sum(F(k+1)*x^k, k=1..infinity) = 1/(1-x-x^2), where F(n) = A000045(n) (Fibonacci numbers).at n=24A147542
- Result of using the Fibonacci numbers as coefficients in an infinite polynomial series in x and then expressing this series as (1+a(1)x)(1+a(2)x^2)(1+a(3)x^3)...at n=24A147558
- 1/Product_{n>=1} (1 - a(n)*x^n) = 1 + Sum_{k>=1} F(k+1)*x^k = 1/(1-x-x^2), where F(n) = A000045(n) (Fibonacci numbers).at n=24A157162
- Prime terms subtracted from Fibonacci terms (ignoring first two terms of Fibonacci sequence).at n=17A160189
- a(n) is the total number of k-reverses of n.at n=17A180249
- Number of (n+1) X 3 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing.at n=8A203446
- Numbers equal to the Euler totient function of their arithmetic derivative: k = phi(k').at n=34A217715
- Number of partitions of n such that (greatest part) - (least part) < number of parts.at n=33A237830
- Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=7A252528
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 397", based on the 5-celled von Neumann neighborhood.at n=43A271689
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 497", based on the 5-celled von Neumann neighborhood.at n=45A272556