8768
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 6
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 17526
- Proper Divisor Sum (Aliquot Sum)
- 8758
- 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
- 4352
- Möbius Function
- 0
- Radical
- 274
- Omega Function (Ω)
- 7
- 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
- 96
- 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
- Discriminants of totally real quartic fields (see comments).at n=32A002769
- Theta series of lattice Kappa_7.at n=21A015236
- n written in fractional base 9/8.at n=35A024656
- a(1) = 7; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=31A025006
- Numbers with 14 divisors.at n=36A030632
- (Largest) diagonal of the Zorach additive triangle A035312.at n=10A035313
- Numbers with multiplicative persistence value 6.at n=8A046515
- Number of nonisomorphic circulant graphs, i.e., undirected Cayley graphs for the cyclic group of order n.at n=29A049287
- 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), starting with a(1) = 1 and a(2) = a(3) = 2.at n=13A049953
- Number of ways to arrange integers 1 through n so that the sum of each adjacent pair is prime, not counting reversals.at n=11A051239
- Number of forests of B-trees of order 3 with n labeled leaves.at n=22A058518
- Number of ways of writing the numbers 1 .. n in a sequence so that the sum of any two adjacent numbers is a prime; reversing the sequence does not count as different.at n=11A064821
- G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)^2).at n=20A083708
- A binomial transform of factorial numbers.at n=11A084261
- Indices of terms in A091074 which are prime numbers.at n=31A091076
- Numbers m whose deficiency is 10, or: sigma(m) = 2m - 10.at n=6A101223
- Matrix log of triangle A098539, which shifts columns left and up under matrix square; these terms are the result of multiplying each element in row n and column k by (n-k)!.at n=39A111810
- Table with g.f. [1-x*n-sqrt(x^2*n^2-2*n*x+1+4*x^2-4*x)]/(2*x).at n=50A128888
- Triangle read by rows: expansion of Q(y, n), where Q(y,0)=1; Q(y,1)=y; Q(y, n) = -(-2 + 2*(1 - y) - 2*(1 - y)*Q(y, n - 1) + Q(y, n - 2)).at n=52A136202
- Numbers k such that k and k^2 use only the digits 2, 4, 6, 7 and 8.at n=21A137101