6311
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6312
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 6310
- Möbius Function
- -1
- Radical
- 6311
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 106
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 821
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that p, p+6, p+12, p+18 are all primes.at n=21A023271
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 79.at n=9A031577
- Lists of 4 primes in arithmetic progression; common difference 6.at n=20A033449
- Initial prime in set of 4 consecutive primes with common difference 6.at n=5A033451
- Number of binary rooted trees with n nodes and height exactly 11.at n=17A036600
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(1,5) < cn(3,5) = cn(4,5).at n=73A036851
- Numbers whose base-5 representation contains exactly two 0's and three 2's.at n=18A045183
- Smallest of three consecutive primes with a difference of 6: primes p such that p+6 and p+12 are the next two primes.at n=44A047948
- First term of balanced prime quartets: p(m+1)-p(m) = p(m+2)-p(m+1) = p(m+3)-p(m+2).at n=5A054800
- Primes q of the form q = 10p + 1, where p is also prime.at n=28A055781
- a(n) = T(n, n-5), array T as in A055818.at n=9A055822
- Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(P).at n=31A057470
- Smallest odd prime p such that Q(sqrt(-p)) has class number 2n+1.at n=44A060651
- Primes p such that p^6 + p^3 + 1 is prime.at n=32A066100
- If n is squarefree then a(n) = Min{k | A070077(k) = n} else 0.at n=40A070078
- a(n) = prime(k) where k = n-th prime congruent to 1 mod 10.at n=34A078656
- a(n) = prime(n*(n+1)/2 + 1).at n=40A078721
- Prime numbers occurring at integer Pythagorean distance (radius) from 1 in Ulam square prime-spiral. Primes on axes are excluded.at n=14A078765
- Least k such that the class number of quadratic order of discriminant D=-4k equals p, where p runs through the primes.at n=23A079029
- Let P(k) = floor(k/2). Start with n, apply P repeatedly until reach 1. a(n) = concatenation of numbers obtained.at n=10A083177