Frugal number
From Wikipedia, the free encyclopedia
| Divisibility-based sets of integers |
| Form of factorization: |
| Prime number |
| Composite number |
| Powerful number |
| Square-free number |
| Achilles number |
| Constrained divisor sums: |
| Perfect number |
| Almost perfect number |
| Quasiperfect number |
| Multiply perfect number |
| Hyperperfect number |
| Unitary perfect number |
| Semiperfect number |
| Primitive semiperfect number |
| Practical number |
| Numbers with many divisors: |
| Abundant number |
| Highly abundant number |
| Superabundant number |
| Colossally abundant number |
| Highly composite number |
| Superior highly composite number |
| Other: |
| Deficient number |
| Weird number |
| Amicable number |
| Sociable number |
| Sublime number |
| Harmonic divisor number |
| Frugal number |
| Equidigital number |
| Extravagant number |
| See also: |
| Divisor function |
| Divisor |
| Prime factor |
| Factorization |
A frugal number is a natural number that has more digits than the number of digits in its prime factorization (including exponents). For example, using base-10 arithmetic, the first few frugal numbers are 125 (53), 128 (27), 243 (35), and 256 (28). Frugal numbers also exist in other bases; for instance, in binary arithmetic thirty-two is a frugal number, since 10101 = 100000.
- R.G.E. Pinch (1998), Economical Numbers