Odd perfect numbers are greater than 10¹⁵⁰⁰
From MaRDI portal
Publication:2894538
Recommendations
- Odd perfect numbers have a prime factor exceeding 10⁸
- Odd perfect numbers have a prime factor exceeding $10^{7}$
- Every odd perfect number has a prime factor which exceeds 10⁶
- Odd perfect numbers
- Odd perfect numbers
- scientific article; zbMATH DE number 2124064
- Several results on the positive odd numbers n that are not a perfect number
- The third largest prime divisor of an odd perfect number exceeds one hundred
- scientific article; zbMATH DE number 3582228
- Odd harmonic numbers exceed \(10^{24}\)
Cites work
- Approximate formulas for some functions of prime numbers
- scientific article; zbMATH DE number 3989433 (Why is no real title available?)
- scientific article; zbMATH DE number 3065066 (Why is no real title available?)
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- New techniques for bounds on the total number of prime factors of an odd perfect number
- Odd perfect numbers have a prime factor exceeding 10⁸
- Odd perfect numbers have at least nine distinct prime factors
Cited in
(22)- Odd perfect numbers: a triptych
- On prime factors of odd perfect numbers
- On the number of prime factors of an odd perfect number
- Odd perfect numbers have a prime factor exceeding 10⁸
- On k-Imperfect Numbers
- scientific article; zbMATH DE number 3989433 (Why is no real title available?)
- There are no small odd perfect numbers
- Odd perfect numbers have a prime factor exceeding $10^{7}$
- On the total number of prime factors of an odd perfect number
- Characterizing quasi-friendly divisors
- Odd perfect numbers, Diophantine equations, and upper bounds
- Perfect and Deficient Perfect Numbers
- Improved upper bounds for odd multiperfect numbers
- scientific article; zbMATH DE number 7674554 (Why is no real title available?)
- Arithmetic, enumerative induction and size bias
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
- On a sequence of densities generated by the greedy algorithm
- Linear support for the prime number sequence and the first and second Hardy-Littlewood conjectures
- On near F_k-perfect and deficient F_k-perfect numbers
- Improved upper bounds for odd perfect numbers. I
- p-adic valuation of the sum of divisors
- Odd perfect numbers and their Euler prime
This page was built for publication: Odd perfect numbers are greater than \(10^{1500}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894538)
