Frugal number

In number theory, a frugal number is a natural number in a given number base that has more digits than the number of digits in its prime factorization in the given number base (including exponents).^[1] For example, in base 10, 125 = 5³, 128 = 2⁷, 243 = 3⁵, and 256 = 2⁸ are frugal numbers (sequence A046759 in the OEIS). The first frugal number which is not a prime power is 1029 = 3 × 7³. In base 2, thirty-two is a frugal number, since 32 = 2⁵ is written in base 2 as 100000 = 10¹⁰¹.

The term economical number has been used for a frugal number, but also for a number which is either frugal or equidigital.

Mathematical definition

Let $b>1$ be a number base, and let $K_{b}(n)=\lfloor \log _{b}{n}\rfloor +1$ be the number of digits in a natural number $n$ for base $b$ . A natural number $n$ has the prime factorisation

n=\prod _{\stackrel {p\,\mid \,n}{p{\text{ prime}}}}p^{v_{p}(n)}

where $v_{p}(n)$ is the p-adic valuation of $n$ , and $n$ is an frugal number in base $b$ if

K_{b}(n)>\sum _{\stackrel {p\,\mid \,n}{p{\text{ prime}}}}K_{b}(p)+\sum _{\stackrel {p^{2}\,\mid \,n}{p{\text{ prime}}}}K_{b}(v_{p}(n)).

Notes

^ Darling, David J. (2004). The universal book of mathematics: from Abracadabra to Zeno's paradoxes. John Wiley & Sons. p. 102. ISBN 978-0-471-27047-8.

References

R.G.E. Pinch (1998), Economical Numbers

Divisibility-based sets of integers

Overview

Integer factorization
Divisor
Unitary divisor
Divisor function
Prime factor
Fundamental theorem of arithmetic

Factorization forms

Constrained divisor sums

With many divisors

Aliquot sequence-related

Base-dependent

Other sets

Classes of natural numbers

Powers and related numbers
Achilles Power of 2 Power of 3 Power of 10 Square Cube Fourth power Fifth power Sixth power Seventh power Eighth power Perfect power Powerful Prime power

Of the form a × 2^b ± 1
Cullen Double Mersenne Fermat Mersenne Proth Thabit Woodall

Other polynomial numbers
Hilbert Idoneal Leyland Loeschian Lucky numbers of Euler

Recursively defined numbers
Fibonacci Jacobsthal Leonardo Lucas Narayana Padovan Pell Perrin

Possessing a specific set of other numbers
Amenable Congruent Knödel Riesel Sierpiński

Expressible via specific sums
Nonhypotenuse Polite Practical Primary pseudoperfect Ulam Wolstenholme

Figurate numbers

2-dimensional

centered	Centered triangular Centered square Centered pentagonal Centered hexagonal Centered heptagonal Centered octagonal Centered nonagonal Centered decagonal Star
non-centered	Triangular Square Square triangular Pentagonal Hexagonal Heptagonal Octagonal Nonagonal Decagonal Dodecagonal

3-dimensional

centered	Centered tetrahedral Centered cube Centered octahedral Centered dodecahedral Centered icosahedral
non-centered	Tetrahedral Cubic Octahedral Dodecahedral Icosahedral Stella octangula
pyramidal	Square pyramidal

4-dimensional

non-centered	Pentatope Squared triangular Tesseractic

Combinatorial numbers
Bell Cake Catalan Dedekind Delannoy Euler Eulerian Fuss–Catalan Lah Lazy caterer's sequence Lobb Motzkin Narayana Ordered Bell Schröder Schröder–Hipparchus Stirling first Stirling second Telephone number Wedderburn–Etherington

Primes
Wieferich Wall–Sun–Sun Wolstenholme prime Wilson

Pseudoprimes
Carmichael number Catalan pseudoprime Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius pseudoprime Lucas pseudoprime Lucas–Carmichael number Perrin pseudoprime Somer–Lucas pseudoprime Strong pseudoprime

Arithmetic functions and dynamics

Divisor functions	Abundant Almost perfect Arithmetic Betrothed Colossally abundant Deficient Descartes Hemiperfect Highly abundant Highly composite Hyperperfect Multiply perfect Perfect Practical Primitive abundant Quasiperfect Refactorable Semiperfect Sublime Superabundant Superior highly composite Superperfect
Prime omega functions	Almost prime Semiprime
Euler's totient function	Highly cototient Highly totient Noncototient Nontotient Perfect totient Sparsely totient
Aliquot sequences	Amicable Perfect Sociable Untouchable
Primorial	Euclid Fortunate

Other prime factor or divisor related numbers
Blum Cyclic Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Jordan–Pólya Lucas–Carmichael Pronic Regular Rough Smooth Sphenic Størmer Super-Poulet Zeisel

Numeral system-dependent numbers

Arithmetic functions
and dynamics

Persistence
- Additive
- Multiplicative

Digit sum	Digit sum Digital root Self Sum-product
Digit product	Multiplicative digital root Sum-product
Coding-related	Meertens
Other	Dudeney Factorion Kaprekar Kaprekar's constant Keith Lychrel Narcissistic Perfect digit-to-digit invariant Perfect digital invariant Happy