6811
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7980
- Proper Divisor Sum (Aliquot Sum)
- 1169
- 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
- 5796
- Möbius Function
- 0
- Radical
- 973
- 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
- 93
- 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 trees of diameter 4.at n=31A000094
- Expansion of x*(1+x-x^2)/((1-x)^4*(1+x)).at n=41A005744
- Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1.at n=16A006145
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite AFO = AlPO4-41 [Al20P20O80] starting with a T3 atom.at n=5A018957
- Strong pseudoprimes to base 97.at n=11A020323
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=21A020411
- For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.at n=45A027442
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 38 ones.at n=39A031806
- Take list of squares, move left digit of each term to end of previous term.at n=42A032760
- First of 3 consecutive numbers which are cubefree and not squarefree, i.e., numbers k such that {k, k+1, k+2} are in A067259.at n=34A071319
- Numbers n such that n and n+2 are of the form p^2*q where p and q are distinct primes.at n=24A074173
- Smallest number whose cube begins and ends in n, or 0 if no such number exists.at n=31A077752
- Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors (excluding the proper divisor 1). Rearrangements which cause leading zeros are excluded.at n=4A086248
- Least multiple of n == 1 (mod prime(n)).at n=48A090938
- a(n+3) = 3*a(n+2) + 2*a(n+1) - a(n).at n=7A095128
- Indices of primes in sequence defined by A(0) = 59, A(n) = 10*A(n-1) - 21 for n > 0.at n=20A101583
- Numbers not of the form a^2 + b^3 + c^4 + d^5 for a,b,c,d >= 0.at n=18A111151
- a(n) = n-th prime * n-th nonprime.at n=33A127118
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, 1), (1, -1), (1, 1)}.at n=8A151440
- Numbers of the form 12n+7 for which Sum_{i=0..(4n+2)} J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol.at n=21A165463