6713
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7866
- Proper Divisor Sum (Aliquot Sum)
- 1153
- 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
- 5712
- Möbius Function
- 0
- Radical
- 959
- Omega Function (Ω)
- 3
- 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
- 137
- 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
- no
- Odd
- yes
Appears in sequences
- Number of binary necklaces of length n with no subsequence 00, excluding the necklace "0".at n=24A000358
- Number of ways to partition n elements into pie slices each with an odd number of elements.at n=24A032189
- Number of partitions satisfying cn(2,5) + cn(3,5) <= 1.at n=41A039857
- Numbers whose base-5 representation contains exactly two 2's and three 3's.at n=22A045273
- Numbers n such that x^n + x^11 + 1 is irreducible over GF(2).at n=29A057481
- Sum of n-th row of triangle of primes: 2; 2 3 2; 2 3 5 3 2; 2 3 5 7 5 3 2; ...; where n-th row contains 2n+1 terms.at n=41A061802
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 5 (most significant digit on right).at n=8A061958
- Product of n-th prime number and n-th composite number.at n=32A067563
- Numbers n such that sigma(sigma(n) - phi(n)) = phi(sigma(n) + phi(n)).at n=4A074876
- Expansion of (1-x)^(-1)/(1-x-2*x^2+x^3).at n=14A077865
- Shadow of sqrt(2).at n=38A110557
- a(n) = (1/9)*((6*n - 7)*2^(n-1) - (-1)^n).at n=10A113861
- Numbers k such that k*(k+3) gives the concatenation of a number m with itself.at n=7A116287
- Positive integers whose sixth power is the sum of seven sixth powers (smallest primitive solutions).at n=38A132410
- Triangle T(n,k) read by rows given by [2,1,2,1,2,1,2,1,2,1,2,1,...] DELTA [1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938 .at n=40A133367
- Positive numbers y such that y^2 is of the form x^2+(x+833)^2 with integer x.at n=26A156835
- Zero-less composite numbers such that exactly eight distinct anagrams are primes.at n=41A163651
- Numbers n such that Mordell's equation y^2 = x^3 + n has exactly 10 integral solutions.at n=36A179153
- Number of lower triangles of a 3 X 3 0..n array with no element differing from any of its horizontal or vertical neighbors by more than one.at n=39A194932
- Triangle T(n,k), read by rows, given by (1,2,2,3,3,4,4,5,5,6,6,...) DELTA (1,0,1,0,1,0,1,0,1,0,1,0,1,...) where DELTA is the operator defined in A084938.at n=32A200659