7758
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
- 12
- Divisor Sum
- 16848
- Proper Divisor Sum (Aliquot Sum)
- 9090
- 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
- 2580
- Möbius Function
- 0
- Radical
- 2586
- 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
- 145
- 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
- a(n) = 3 + n/2 + 7*n^2/2.at n=47A006124
- Number of indefinitely growing n-step self-avoiding walks on Manhattan lattice.at n=15A006745
- a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n+1-k), where k = [ (n+1)/2 ], p = A000040 = the primes.at n=21A024697
- a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n-k+1), where k = [ n/2 ], p = A000040, the primes.at n=21A025129
- Number of partitions in parts not of the form 7k, 7k+2 or 7k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 2 are greater than 1.at n=50A035938
- Let u be any string of n digits from {0,1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-2 number; then a(n) = max_u f(u).at n=19A065843
- Interprimes which are of the form s*prime, s=18.at n=20A075293
- Even numbers n such that N(n) is divisible by a nontrivial square, say m^2 with gcd(n,m) = 1, where N(n) is the numerator of the Bernoulli number B(n). The smallest numbers m are given in A094095.at n=14A090943
- Triangle, read by rows, such that the convolution of each row with {1,2} produces a triangle which, when flattened, equals this flattened form of the original triangle.at n=52A092686
- Number of subsets of {1,2,3,...,n} whose sum is a square integer (including the empty subset).at n=17A126024
- Numbers n with property that 4 n^2 are squares arising in A158470.at n=23A158517
- Averages of twin prime pairs that are sums of 4 consecutive averages of twin prime pairs.at n=14A160918
- Integers of the form (k+1)*(2k+1)/12.at n=35A164578
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 1,5,5,0,0,4,3 for x=0,1,2,3,4,5,6.at n=5A197570
- Number of n X 5 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 5 array.at n=18A219499
- Number of partitions of 4 copies of n into distinct parts.at n=14A258282
- Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and with no two consecutive increases.at n=19A263637
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 659", based on the 5-celled von Neumann neighborhood.at n=17A273386
- Numbers k such that (2*10^k + 67)/3 is prime.at n=21A285940
- Triangle read by rows: Take a hexagon with all diagonals drawn, as in A331931. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+4.at n=19A331932