6876
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 10596
- 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
- 2280
- Möbius Function
- 0
- Radical
- 1146
- Omega Function (Ω)
- 5
- 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
- 150
- 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
- Cluster series for honeycomb.at n=16A003204
- a(n) = (n+1)*(a(n-1)/n + a(n-2)), with a(0)=1, a(1)=2.at n=8A013989
- Numerators of continued fraction convergents to sqrt(143).at n=5A041262
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n -1 <= 2^(p+1), with a(1) = 1, a(2) = 3, and a(3) = 4.at n=12A049977
- Sigmabonacci numbers: a(n)=a(n-1)+Sigma(a(n-2)). Sigma(n)=Sum of divisors of n.at n=14A074371
- Chebyshev sequence T(n,12) with Diophantine property.at n=3A077424
- Numbers k such that A049614(k) + A000040(k) is prime.at n=20A078744
- a(n) = n^3 + 17.at n=19A084379
- Smallest multiple of n sandwiched between two numbers both having square divisors.at n=35A085051
- Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 6.at n=25A091774
- Expansion of (1+x)/((1-x)^2-5x^3).at n=11A097118
- Euler-Seidel matrix T(k,n) with start sequence A001147, read by antidiagonals.at n=56A099020
- Polar structured meta-anti-diamond numbers, the n-th number from a polar structured n-gonal anti-diamond number sequence.at n=11A100188
- Numbers k such that 10^k + 6*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=24A102940
- Triangle T(n, k) = binomial(n, k) * A000085(n-k), 0 <= k <= n.at n=46A111062
- Number of compositions of n such that no two adjacent parts are equal, allowing 0.at n=9A114900
- Let T(S,Q) be the sequence obtaining by starting with S and repeatedly reversing the digits and adding Q to get the next term. This is T(1016,5), the first S for which T(S,5) reaches a cycle of length 36.at n=29A118879
- a(n) = ChebyshevT(3, n).at n=12A144129
- Zero followed by partial sums of A008865.at n=27A145067
- 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, 1), (-1, 0, 1), (-1, 1, 0), (0, 0, -1), (1, 0, 0)}.at n=9A148585