7676
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14280
- Proper Divisor Sum (Aliquot Sum)
- 6604
- 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
- 3600
- Möbius Function
- 0
- Radical
- 3838
- Omega Function (Ω)
- 4
- 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
- 132
- 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
- Expansion of Product_{m>=1} (1+x^m)^19.at n=4A022584
- Ordered sequence of distinct terms of the form floor(exp(i) * floor(exp(j))), i,j >= 0.at n=37A022765
- a(n) = (3*n+1)*(4*n+1).at n=25A033577
- Number of distinct solutions to reverse the 8 puzzle (3 X 3 analog of the 4 X 4 15 puzzle) in 28, 30, 32, ... moves.at n=5A046164
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=13A049958
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.at n=17A050788
- Sum of a(n) terms of 1/k^(3/4) first exceeds n.at n=34A056179
- a(n) = floor(n*exp(n)).at n=7A058738
- a(n) = round(n*exp(n)).at n=7A058748
- Term at which first number of height n occurs in Recamán's sequence A005132.at n=18A064292
- Minimal total volume of n bricks with integer sides, all sides being different. Lowest value of sum of products of triples p*q*r chosen from [1,3n].at n=7A072368
- Sum of odd-indexed primes.at n=40A077131
- Sum of the sides of ordered 2 X 2 prime squares.at n=40A105088
- Molecular topological indices of the path graphs P_n.at n=22A121318
- 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, 0), (-1, -1, 1), (-1, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=10A148085
- a(n) = (2*n^3 + 5*n^2 - 9*n)/2.at n=18A162258
- Numbers m such that the sum of square of factorial of decimal digits is square.at n=40A173689
- Numbers n such that d(n-1) = d(n+1) = 6, where d(k) is the number of divisors of k (A000005).at n=30A190267
- Number of permutations of an n X 4 array with each element moving exactly one horizontally or vertically and without 2-loops.at n=6A216796
- Number of permutations of an n X 7 array with each element moving exactly one horizontally or vertically and without 2-loops.at n=3A216799