5688
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
- 24
- Divisor Sum
- 15600
- Proper Divisor Sum (Aliquot Sum)
- 9912
- 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
- 1872
- Möbius Function
- 0
- Radical
- 474
- Omega Function (Ω)
- 6
- 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
- 67
- 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
- Heptagonal numbers (or 7-gonal numbers): n*(5*n-3)/2.at n=48A000566
- Taylor series related to one in Ramanujan's Lost Notebook.at n=23A006305
- Coordination sequence for 4-dimensional RR-centered di-isohexagonal orthogonal lattice.at n=8A008528
- Even heptagonal numbers (A000566).at n=24A014640
- a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=22A026043
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A026082.at n=7A026085
- Number of partitions of n into an odd number of parts, the least being 4; also, a(n+4) = number of partitions of n into an even number of parts, each >=4.at n=63A027190
- Inflation orbit counts.at n=17A031367
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=8A037159
- a(n) = prime(n)*prime(n+1) - prime(n+1).at n=20A037167
- Shifts left under transform T where Ta is a DCONV a.at n=13A038044
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 9 skipped primes.at n=36A050776
- Row sums of array T in A053199.at n=6A053297
- Numbers k such that phi(x) = k has exactly 10 solutions.at n=29A060673
- a(n) = Sum_{k=1..n} d(k)*prime(k), where d(k) = A001223.at n=27A064009
- G.f. satisfies: A(x) = 1 + x*A(x) + x^3*A(x)^3.at n=12A071879
- Numbers m such that the numerator of Sum_{i=1..m} prime(i)/prime(i+1) is prime.at n=10A090808
- Index of first occurrence of n in A122921.at n=46A122925
- Triangle T(n,k), n>=1, 1<=k<=n, read by rows, where sequence a_k of column k begins with (k+1) 1's and a_k(n) shifts k places down under Dirichlet convolution.at n=91A144374
- Numbers A141426(k) such that the three numbers A141426(k) -/+ 5 and A141426(k) + 1 are all prime.at n=38A144737