6371
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
- 4
- Divisor Sum
- 6672
- Proper Divisor Sum (Aliquot Sum)
- 301
- 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
- 6072
- Möbius Function
- 1
- Radical
- 6371
- Omega Function (Ω)
- 2
- 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
- 31
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Positions of remoteness 4 in Beans-Don't-Talk.at n=24A005696
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=35A024837
- StirlingS2[ n,m ] triangle summed down the columns.at n=51A036560
- Row sums of triangle A054453.at n=12A054455
- Ninth column (k=8) of septinomial array A063265.at n=6A063417
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=9A065903
- Numbers k such that k + (largest digit of k)! is a palindromic prime.at n=5A095920
- Numbers n where n^2 = x^3 + y^3; x,y>0 and gcd(x,y)=1.at n=4A099426
- One third of the sum of the first n primes, when an integer.at n=28A112270
- a(n) = sum(2^(A047240(i)-1), i=1..n).at n=6A113854
- Number of permutations of length n which avoid the patterns 1234, 3142, 4132.at n=8A116788
- Triangle read by rows, A000012 * A008277.at n=51A137649
- 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, 0, 1), (0, -1, 1), (1, 1, -1), (1, 1, 1)}.at n=7A149743
- Integers of the form m*(6*m -+ 1)/2.at n=45A154292
- G.f.: (21+98*x+91*x^2+21*x^3+x^4)/(1-x)^5.at n=4A160768
- Zero-less composite numbers such that exactly eight distinct anagrams are primes.at n=40A163651
- a(n) = ceiling(A029826(n)/2).at n=69A173894
- Semiprimes s such that s^2 is expressible as the sum of two positive cubes.at n=3A183150
- Number of n X 2 binary arrays with each sum of a(1..i,1..j) no greater than i*j/2 and rows and columns in nondecreasing order.at n=44A183409
- Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^3 equal to 49*n^3.at n=23A184322