6413
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7182
- Proper Divisor Sum (Aliquot Sum)
- 769
- 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
- 5720
- Möbius Function
- 0
- Radical
- 583
- 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
- 62
- 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 free planar polyenoids with n nodes and symmetry point group C_{2v}.at n=19A000936
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=4A025515
- Number of primes < n^3.at n=39A038098
- Numerators of continued fraction convergents to sqrt(998).at n=6A042932
- a(n) = T(n,n-4), array T as in A055807.at n=29A055809
- Numbers k such that k | 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.at n=39A057261
- Prime(a(n)) + ... + prime(a(n)+3) is a square = A051395(n)^2.at n=15A072849
- a(1)=1, then a(n)=2*a(n-1) if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.at n=47A080735
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.at n=23A081378
- a(1)=1, a(n)=2a(n-1)+1 if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.at n=36A083005
- Minimal last term of an n-tuple of pairwise coprime composites in A.P.at n=7A087795
- Triangle, read by rows, such that the initial terms of the binomial transform of the n-th row forms the n-th row of triangle A059438 transposed (permutations of [1..n] with k components).at n=51A091063
- Expansion of (1+x^2)/(1-x-x^5) = (1+x^2)/((1-x+x^2)*(1-x^2-x^3)).at n=32A098523
- Number of base 17 circular n-digit numbers with adjacent digits differing by 4 or less.at n=4A125354
- Numbers k such that 2^(2*k-7)-7 is prime.at n=6A138578
- a(n) = n^3 - 3*(n+3)^2.at n=20A153260
- Numbers n such that 10^n*(5+3*10^n)+3 is prime.at n=6A171629
- Numbers k such that sum_{i=1..k} d(i)^2 is a square c^2, where d(i) is the number of divisors of i.at n=11A186429
- Numbers k with equal remainders of (product of divisors of k) mod (sum of divisors of k) and (product of proper divisors of k) mod (sum of proper divisors of k).at n=22A192035
- Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first and second differences in -n..n.at n=41A209008