7767
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
- 6
- Divisor Sum
- 11232
- Proper Divisor Sum (Aliquot Sum)
- 3465
- 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
- 5172
- Möbius Function
- 0
- Radical
- 2589
- Omega Function (Ω)
- 3
- 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
- 52
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5)).at n=49A036814
- Partial sums of primes congruent to 1 mod 6.at n=38A038349
- Numbers having three 7's in base 10.at n=20A043519
- Numbers k such that 193*2^k-1 is prime.at n=9A050848
- Number of partitions of n with parts (with repetitions) forming a division lattice (i.e., closed under GCD and LCM).at n=58A051839
- Index of the primes in A084163.at n=13A084164
- Total number of parts in all partitions of n into prime parts.at n=48A084993
- Start with the binary representation of the Catalan constant (A104338, A006752) = 0.91596559... = sum_{i=1..infinity} b(i)/2^i, where b(i)=1,1,1,0,1,0,1,0,0,1,1,1,1.... Then a(n-1)=sum_{i=1..k: sum_{ j = 1..k} b(j)=n} b(i) * 2^(i-1). In words: scan the binary digits of the number, halt at each nonzero binary digit, add a power of 2 corresponding to the place of this digit after the comma, assign current partial sum to a(n), increment n.at n=8A113860
- Starting with 1, each number is the previous number plus the product of the index number and the sum of the digits of the previous number.at n=30A113904
- Numbers k such that k concatenated with k+3 gives the product of two numbers which differ by 7.at n=1A116180
- Start with 1015 and repeatedly reverse the digits and add 4 to get the next term.at n=77A117807
- Start with 1027 and repeatedly reverse the digits and add 16 to get the next term.at n=41A119455
- Numbers expressible in more than one way as 6^x-y^2.at n=14A134989
- Ulam's spiral (WNW spoke).at n=22A143859
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1100-1111-0100 pattern in any orientation.at n=9A146713
- Convolution triangle by rows, A004736 * (A154108 * 0^(n-k)); row sums = Bell numbers.at n=52A154109
- Indices of 4's in A090822.at n=34A157107
- Numbers n such that n^3 - 4 and n^3 + 4 are prime.at n=32A161589
- Partial sums of primes of the form 3*k-1.at n=41A172188
- Numbers k such that 6^7 + k^2 is a square.at n=17A180971