Narcissistic number

In recreational number theory, a narcissistic number^[1]^[2] (also known as a pluperfect digital invariant (PPDI),^[3] an Armstrong number^[4] (after Michael F. Armstrong)^[5] or a plus perfect number)^[6] is a number that is the sum of its own digits each raised to the power of the number of digits. This definition depends on the base b of the number system used, e.g., b = 10 for the decimal system or b = 2 for the binary system.

Definition

The definition of a narcissistic number relies on the decimal representation n = d_kd_k-1...d₁ of a natural number n, i.e.,

n = d_k·10^k-1 + d_k-1·10^k-2 + ... + d₂·10 + d₁,

with k digits d_i satisfying 0 ≤ d_i ≤ 9. Such a number n is called narcissistic if it satisfies the condition

n = d_k^k + d_k-1^k + ... + d₂^k + d₁^k.

For example the 3-digit decimal number 153 is a narcissistic number because 153 = 1³ + 5³ + 3³.

Narcissistic numbers can also be defined with respect to numeral systems with a base b other than b = 10. The base-b representation of a natural number n is defined by

n = d_kb^k-1 + d_k-1b^k-2 + ... + d₂b + d₁,

where the base-b digits d_i satisfy the condition 0 ≤ d_i ≤ b-1. For example the (decimal) number 17 is a narcissistic number with respect to the numeral system with base b = 3. Its three base-3 digits are 122, because 17 = 1·3² + 2·3 + 2 , and it satisfies the equation 17 = 1³ + 2³ + 2³.

If the constraint that the power must equal the number of digits is dropped, so that for some m possibly different from k it happens that

n = d_k^m + d_k-1^m + ... + d₂^m + d₁^m,

then n is called a perfect digital invariant or PDI.^[7]^[2] For example, the decimal number 4150 has four decimal digits and is the sum of the fifth powers of its decimal digits

4150 = 4⁵ + 1⁵ + 5⁵ + 0⁵,

so it is a perfect digital invariant but not a narcissistic number.

In "A Mathematician's Apology", G. H. Hardy wrote:

There are just four numbers, after unity, which are the sums of the cubes of their digits:

370=3^3+7^3+0^3

371=3^3+7^3+1^3

407=4^3+0^3+7^3

These are odd facts, very suitable for puzzle columns and likely to amuse amateurs, but there is nothing in them which appeals to the mathematician.

Narcissistic numbers in various bases

The sequence of base 10 narcissistic numbers starts: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, ... (sequence A005188 in the OEIS)

The sequence of base 8 narcissistic numbers starts: 0, 1, 2, 3, 4, 5, 6, 7, 24, 64, 134, 205, 463, 660, 661, ... (sequence A010354 and A010351 in OEIS)

The sequence of base 12 narcissistic numbers starts: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ᘔ, Ɛ, 25, ᘔ5, 577, 668, ᘔ83, ... (sequence A161949 in the OEIS)

The sequence of base 16 narcissistic numbers starts: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F, 156, 173, 208, 248, 285, 4A5, 5B0, 5B1, 60B, 64B, ... (sequence A161953 in the OEIS)

The sequence of base 3 narcissistic numbers starts: 0, 1, 2, 12, 22, 122

The sequence of base 4 narcissistic numbers starts: 0, 1, 2, 3, 130, 131, 203, 223, 313, 332, 1103, 3303 (sequence A010344 and A010343 in OEIS)

In base 2, the only narcissistic numbers are 0 and 1.

The number of narcissistic numbers in a given base is finite, since the maximum possible sum of the kth powers of a k digit number in base b is

k(b-1)^k\, ,

and if k is large enough then

k(b-1)^k<b^{k-1}\, ,

in which case no base b narcissistic number can have k or more digits. Setting b equal to 10 shows that the largest narcissistic number in base 10 must be less than 10⁶⁰.^[1]

There are only 88 narcissistic numbers in base 10, of which the largest is

115,132,219,018,763,992,565,095,597,973,971,522,401

with 39 digits.^[1]

Clearly, in all bases, all one-digit numbers are narcissistic numbers.

A base b has at least one two-digit narcissistic number if and only if b² + 1 is not prime, and the number of two-digit narcissistic numbers in base b equals $\tau (b^{2}+1)-2$ , where $\tau (n)$ is the number of positive divisors of n.

Every base b ≥ 3 that is not a multiple of nine has at least one three-digit narcissistic number. The bases that do not are

2, 72, 90, 108, 153, 270, 423, 450, 531, 558, 630, 648, 738, 1044, 1098, 1125, 1224, 1242, 1287, 1440, 1503, 1566, 1611, 1620, 1800, 1935, ... (sequence A248970 in the OEIS)

Unlike narcissistic numbers, no upper bound can be determined for the size of PDIs in a given base, and it is not currently known whether or not the number of PDIs for an arbitrary base is finite or infinite.^[2]

Related concepts

The term "narcissistic number" is sometimes used in a wider sense to mean a number that is equal to any mathematical manipulation of its own digits. With this wider definition narcisstic numbers include:

Constant base numbers : $n=m^{d_k} + m^{d_{k-1}} + \dots + m^{d_2} + m^{d_1}$ for some m.
Perfect digit-to-digit invariants or Münchhausen numbers (sequence A046253 in the OEIS) : : $\textstyle n=\sum _{{i=0}}^{k}d_{i}^{{d_{i}}}\,,{\text{ e.g. }}3435=3^{3}+4^{4}+3^{3}+5^{5}\,.$
Ascending power numbers (sequence A032799 in the OEIS) : $n = d_k^1 + d_{k-1}^2 + \dots + d_2^{k-1} + d_1^k\, ,\text{ e.g. } 135 = 1^1 + 3^2 + 5^3 \, .$
Friedman numbers (sequence A036057 in the OEIS).
Radical narcissistic numbers (sequence A119710 in the OEIS) ^[8] ${ e.g. } 729 = (7+2)^{\sqrt{9}}, \text{ }4096=\sqrt{\sqrt{\sqrt{\sqrt{4}+0}}}^{96}$
Sum-product numbers (sequence A038369 in the OEIS) : $n=\left(\sum _{{i=1}}^{{k}}{d_{i}}\right)\left(\prod _{{i=1}}^{{k}}{d_{i}}\right)\,,{\text{ e.g. }}144=(1+4+4)\times (1\times 4\times 4)\,.$
Dudeney numbers (sequence A061209 in the OEIS) : $n=\left(\sum _{{i=1}}^{{k}}{d_{i}}\right)^{3}\,,{\text{ e.g. }}512=(5+1+2)^{3}\,.$
Factorions (sequence A014080 in the OEIS) : $n=\sum_{i=1}^{k}{d_i}!\, ,\text{ e.g. } 145 = 1! + 4! + 5! \, .$

where d_i are the digits of n in some base.

Fresnillense numbers (sequence A240511 in the OEIS) : $\,,{\text{ e.g. }}336=(3^{1}+3^{1}+6^{1})+(3^{2}+3^{2}+6^{2})+(3^{3}+3^{3}+6^{3})\,.$

References

1 2 3 Weisstein, Eric W. "Narcissistic Number". MathWorld.
1 2 3 Perfect and PluPerfect Digital Invariants by Scott Moore
↑ PPDI (Armstrong) Numbers by Harvey Heinz
↑ Armstrong Numbers by Dik T. Winter
↑ Lionel Deimel’s Web Log
↑ (sequence A005188 in the OEIS)
↑ PDIs by Harvey Heinz
↑ Rose, Colin (2005), Radical Narcissistic Numbers, Journal of Recreational Mathematics, 33(4), pages 250-254.

Joseph S. Madachy, Mathematics on Vacation, Thomas Nelson & Sons Ltd. 1966, pages 163-175.
Rose, Colin (2005), Radical narcissistic numbers, Journal of Recreational Mathematics, 33(4), 2004-2005, pages 250-254.
Perfect Digital Invariants by Walter Schneider

External links

Java program to check for Armstrong number

Digital Invariants
Armstrong Numbers
Armstrong Numbers in base 2 to 16
Armstrong numbers between 1-999 calculator
Symonds, Ria. "153 ♥ Narcissistic Number". Numberphile. Brady Haran.

Classes of natural numbers

Powers and
related numbers

Of the form
a × 2^b ± 1

Other polynomial
numbers

Recursively defined
numbers

Possessing a
specific set
of other numbers

Expressible via
specific sums

Generated
via a sieve

Lucky

Code related

Meertens

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 Octahedral Dodecahedral Icosahedral Stella octangula

pyramidal	Square pyramidal Pentagonal pyramidal Hexagonal pyramidal Heptagonal pyramidal

4-dimensional

centered	Centered pentachoric Squared triangular

non-centered	Pentatope

Pseudoprimes

Combinatorial
numbers

Arithmetic functions

By properties of σ(n)	Abundant Almost perfect Arithmetic Colossally abundant Descartes Hemiperfect Highly abundant Highly composite Hyperperfect Multiply perfect Perfect Practical number Primitive abundant Quasiperfect Refactorable Sublime Superabundant Superior highly composite Superperfect

By properties of Ω(n)	Almost prime Semiprime

By properties of φ(n)	Highly cototient Highly totient Noncototient Nontotient Perfect totient Sparsely totient

By properties of s(n)	Amicable Betrothed Deficient Semiperfect

Dividing a quotient

Other prime factor
or divisor related
numbers

Recreational
mathematics

Base-dependent
numbers

This article is issued from Wikipedia - version of the 11/14/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.