6873
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9600
- Proper Divisor Sum (Aliquot Sum)
- 2727
- 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
- 4368
- Möbius Function
- -1
- Radical
- 6873
- Omega Function (Ω)
- 3
- 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
- 31
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = (number of nonisomorphic nontransitive prime tournaments on n nodes) - Moebius(n).at n=7A002638
- Smallest number a(n)>a(n-1) such that T(a(n-1))+T(a(n))=T(m) for some m, a(1)=3; T(i) are the triangular numbers.at n=23A072522
- Expansion of (1-x)^(-1)/(1 + x - x^2 + x^3).at n=16A077902
- p + P(p) where p is the n-th prime and P(p) is the unrestricted partition number of p.at n=10A098145
- Sum of n and partition number of n.at n=31A133041
- a(n) = n*(8*n+5).at n=29A139277
- Second bisection of A061041: a(n) = A061041(2n+1) = (2*n+1)*(2*n+9).at n=39A145923
- a(n) = A000041(n) + n*A032741(n).at n=31A168015
- Numbers k such that 2^k + k^2 + 2 is prime.at n=16A177070
- Constant term in the reduction of the polynomial 1+x+x^2+...+x^n by x^3->x^2+x+1. See Comments.at n=17A192804
- Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=8A193046
- Numbers a(n) for which there exists k>1 such that the number of partitions of a(n) into k parts is k.at n=30A209122
- a(1) = least k such that 1/3 < H(k) - 1/3; a(2) = least k such that H(a(1)) - H(3) < H(k) - H(a(1)), and for n > 2, a(n) = least k such that H(a(n-1)) - H(a(n-2)) > H(k) - H(a(n-1)), where H = harmonic number.at n=12A225605
- G.f.: Sum_{n>=1} x^n * (1+x)^n / (1-x^n).at n=18A227635
- Start of a triple of consecutive squarefree numbers each of which has exactly 3 distinct prime factors.at n=39A242606
- Number of length n+2 0..2 arrays with some pair in every consecutive three terms totalling exactly 2.at n=7A245864
- T(n,k)=Number of length n+2 0..k arrays with some pair in every consecutive three terms totalling exactly k.at n=43A245869
- Number of nonisomorphic nontransitive prime tournaments on n nodes.at n=7A259106
- Erroneous version of A259700.at n=8A259699
- Number of odd-length columns in all bargraphs having semiperimeter n (n>=2).at n=8A273902