Skip to content
Surf Wiki
Save to docs
general/base-dependent-integer-sequences

From Surf Wiki (app.surf) — the open knowledge base

Extravagant number

Number that has fewer digits than the number of digits in its prime factorization


Summary

Number that has fewer digits than the number of digits in its prime factorization

In number theory, an extravagant number (also known as a wasteful number) is a natural number in a given number base that has fewer digits than the number of digits in its prime factorization in the given number base (including exponents). For example, in base 10, 4 = 22, 6 = 2×3, 8 = 23, and 9 = 32 are extravagant numbers .

There are infinitely many extravagant numbers in every base.

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 extravagant number in base b if : K_b(n)

Notes

References

References

  1. Darling, David J.. (2004). "The universal book of mathematics: from Abracadabra to Zeno's paradoxes". [[John Wiley & Sons]].
Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about Extravagant number — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report