6340
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13356
- Proper Divisor Sum (Aliquot Sum)
- 7016
- 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
- 2528
- Möbius Function
- 0
- Radical
- 3170
- Omega Function (Ω)
- 4
- 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
- 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 Twopins positions.at n=21A005689
- Noncircumscribable simplicial polyhedra with n nodes.at n=12A007034
- Coordination sequence for FeS2-Marcasite, Fe position.at n=39A009955
- Pisot sequence T(6,10), a(n) = floor(a(n-1)^2/a(n-2)).at n=16A020741
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+11 or 24k-11. Also number of partitions in which no odd part is repeated, with at most 5 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=43A036034
- Numerators of continued fraction convergents to sqrt(395).at n=5A041750
- Numbers whose base-5 representation contains exactly three 0's and two 3's.at n=16A045201
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2 and a(3) = 3.at n=15A049911
- Irregular triangle read by rows giving T(n,k) = number of rooted graphs on n + 1 nodes with k edges (n >= 0, 0 <= k <= n(n-1)/2).at n=74A070166
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 3), divided by 3.at n=35A073360
- Interprimes which are of the form s*prime, s=20.at n=9A075295
- Where 5^n occurs in n-almost-primes, starting at a(0)=1.at n=8A078844
- a(n) = A065621(n^2).at n=45A114390
- Abs(*+-) n Sequence.at n=37A119518
- First row of infinite array A(j,k): A(j,1) = j-1; A(1,k) = A(2,k-1); for j, k > 1, A(j,k) = A(j-1,k) - A(j+1,k-1) if that number is positive and not already in column k, A(j,k) = A(j-1,k) + A(j+1,k-1) otherwise.at n=17A140985
- Partial sums of prime numbers of measurement A002049.at n=25A173702
- Number of 4-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions.at n=18A187509
- Number of nondecreasing arrangements of 5 nonzero numbers in -(n+3)..(n+3) with sum zero.at n=12A188335
- Least number having n orderless representations as p^2 + q^2 + r^2 + s^2, where p, q, r, and s are primes.at n=28A214513
- Numbers k such that 2^k - 1 - Sum_{prime p<k} 2^p is prime.at n=26A215888