8671
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 1409
- 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
- 7392
- Möbius Function
- -1
- Radical
- 8671
- 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
- 65
- 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
- Numerator of 2^n*(3*n-3)!/( ((n-1)!)^3 * (2*n)! ).at n=10A004677
- Expansion of e.g.f. cos(tan(tanh(x))), even terms only.at n=5A009069
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite FER = Ferrierite Na2Mg2[Al6Si30O72].18H2O starting with a T2 atom.at n=12A019133
- Fibonacci sequence beginning 0, 23.at n=14A022357
- n(n+Z(n)), where Z( ) is the Narayana-Zidek-Capell sequence (A002083).at n=13A030625
- Double and reverse digits.at n=8A036447
- Expansion of (3 + x^2) / (1 - x)^4.at n=22A037237
- Reverse or double: if reverse of a(n) > a(n), then a(n+1) = a(n) reversed, otherwise a(n+1) = 2*a(n).at n=11A041013
- Numbers n such that n and its reversal are both multiples of 13.at n=41A062903
- Non-palindromic number and its reversal are both multiples of 13.at n=26A062912
- Numbers which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end).at n=59A068679
- Digital sum of n = sum of palindromes from the smallest prime factor of n to the largest prime factor of n.at n=10A074310
- Denominator of Product_{i=1..n} (p_i+1)/(p_i-1). Numerators are in A078559.at n=16A078560
- a(0)=1, a(1)=2; a(2n) = 2*a(2n-1)+1; a(2n+1) = a(2n) + x, where x is the least number not yet the difference of two terms.at n=21A111328
- Numbers multiplied by 4 and written backwards.at n=4A132064
- Least k such that the cyclotomic polynomial Phi(k,x) contains n or -n as a coefficient, where k is restricted to be the product of 3 distinct prime numbers.at n=4A134518
- Triangular sequence: f(n) = Product[Prime[a]*k + Prime[b], {k,0,n}]; a = 2; b = 1; t(n,m) = Numerator[f(n)/(f(n-m)*f(m))].at n=51A154096
- Triangular sequence: f(n) = Product[Prime[a]*k + Prime[b], {k,0,n}]; a = 2; b = 1; t(n,m) = Numerator[f(n)/(f(n-m)*f(m))].at n=50A154096
- Triangular sequence: f(n) = Product[Prime[a]*k + Prime[b], {k,0,n}]; a = 2; b = 1; t(n,m) = Numerator[f(n)/(f(n-m)*f(m))].at n=49A154096
- Triangular sequence: f(n) = Product[Prime[a]*k + Prime[b], {k,0,n}]; a = 2; b = 1; t(n,m) = Numerator[f(n)/(f(n-m)*f(m))].at n=48A154096