176661

Appears in sequences

• Hyperperfect numbers: k = m*(sigma(k) - k - 1) + 1 for some m > 1.at n=19A007592
• 2-hyperperfect numbers: n = 2*(sigma(n) - n - 1) + 1.at n=3A007593
• Hyperperfect numbers: x such that x = 1 + k*(sigma(x)-x-1) for some k > 0.at n=23A034897
• Sum 3^max(k,n-k),k=0..n.at n=10A107660
• Nonsemiprime hyperperfect numbers.at n=7A133447
• Consider the aliquot parts, in ascending order, of a composite number. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to themselves.at n=10A246544
• Composite numbers k such that the sum of their aliquot parts divides k+1.at n=23A306532
• Bi-unitary k-hyperperfect numbers: numbers m such that m = 1 + k * (bsigma(m) - m - 1) where bsigma(m) is the sum of bi-unitary divisors of m (A188999) and k >= 1 is an integer.at n=19A309568