134193152

Appears in sequences

• Numbers k such that sigma(k) == 2 (mod k).at n=9A045768
• Numbers n such that sigma(n) = 2n + omega(n), where omega(n) is the number of distinct prime divisors of n.at n=10A063785
• The floor(n/2)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.at n=14A066240
• Numbers k whose abundance-radius does not exceed log(log(k)), i.e., abs(sigma(k)-2*k) <= log(log(k)).at n=33A088818
• Numbers k whose abundance is 2: sigma(k) - 2k = 2.at n=8A088831
• Near-perfect numbers (A181595) of the form 2^(t-1)*(2^t-2^k-1), where 2^t-2^k-1 is prime, k>=1, t>k.at n=34A181701
• Numbers of the form 2^(t-1)*(2^t-3), where 2^t-3 is prime.at n=7A181703
• Numbers m such that floor(antisigma(m) / m) = antisigma(m) mod m.at n=18A244324
• Numbers k such that bsigma(k) = 2k + 2, where bsigma(k) is the sum of bi-unitary divisors of k (A188999).at n=9A322162
• Practical numbers (A005153) that are abundant and have a record low value of abundancy index.at n=26A362052
• Primitive abundant numbers k (A071395) whose abundancy index sigma(k)/k has a record low value.at n=27A362053