442365

Appears in sequences

• Odd numbers with exactly 5 distinct palindromic prime factors.at n=8A046407
• Odd numbers which can be written in precisely one way as sum of a subset of their proper divisors.at n=3A065235
• Odd numbers m whose abundance by absolute value is at most 10, that is, -10 <= sigma(m) - 2m <= 10.at n=12A077374
• Numbers k such that sigma(k) - 2k = 6.at n=2A087167
• Odd numbers n such that abs(sigma(n)-2n) <= n^(1/3). Abundance-radius = abs(sigma(n)-2n) does not exceed cubic root of n and n is odd.at n=13A088010
• Odd solutions to abs(sigma(k) - 2k) <= log(k). Numbers k whose abundance-radius does not exceed log(k).at n=3A088012
• Numbers k such that sigma(k) == 6 (mod k).at n=7A088834
• Odd admirable numbers: such that sigma(n) = 2n + 2d for some d | n.at n=31A109729
• Admirable numbers such that the subtracted divisor is prime.at n=11A109766
• Admirable numbers whose abundance is < 10.at n=26A109788
• Near-multiperfects with primes, powers of 2, 6 * prime and 2^n * prime excluded, abs(sigma(n) mod n) <= log(n).at n=29A117350
• Odd numbers whose abundancy is closer to 2 than any smaller odd number.at n=14A171929
• Odd abundant numbers whose abundancy is closer to 2 than any smaller odd abundant number.at n=8A188263
• Numbers n such that sigma(n) = m*sigma(n+2) with some m > 1.at n=8A260988
• Numbers k such that sigma(k) == 0 (mod k+3).at n=3A274551
• Admirable numbers such that the subtracted divisor is a Fibonacci number.at n=26A282754
• Largest squarefree odd primitive abundant number with n prime factors.at n=0A287581
• Abundant numbers whose abundance is a perfect number.at n=15A301859
• Odd unitary admirable numbers: the odd terms of A328328.at n=5A329188
• Subsequence of A071395. The extra constraint is m is not a term if m*q/p is abundant where prime p|m and q is the least prime larger than p.at n=25A333967