2087936

Appears in sequences

• Numbers k such that sigma(k) == 8 (mod k).at n=15A045770
• Numbers k with abundance radius of 8, i.e., abs(sigma(k)-2*k) = 8.at n=24A088820
• Numbers k whose abundance is 8: sigma(k) - 2*k = 8.at n=11A088833
• Admirable numbers whose abundance is < 10.at n=30A109788
• Numbers m with divisor 8 | m and abundance sigma(m)-2*m = 8.at n=6A181598
• 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=23A181701
• Numbers of the form 2^(t-1)*(2^t-9), where 2^t-9 is prime.at n=3A181705
• Numbers k such that sigma(k) == 0 (mod k+4).at n=15A274553
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 369", based on the 5-celled von Neumann neighborhood.at n=20A287859
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 491", based on the 5-celled von Neumann neighborhood.at n=20A288653
• a(n) is the largest positive integer that is abundant and has the same prime signature as A025610(n) or 0 if no such number exists.at n=34A343329