# On the small prime factors of a non-deficient number

25 May 2020  ·  Joshua Zelinsky ·

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$... We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second smallest, third smallest and fourth smallest prime factors. We also obtain tighter bounds for odd perfect numbers. We also discuss the behavior of $\sigma(n!+1)$, $\sigma(2^n+1)$, and related sequences. read more

PDF Abstract

## Code Add Remove Mark official

No code implementations yet. Submit your code now

## Categories

Number Theory 11A25, 11N64