Narcissistic number

Short description: Integer expressible as the sum of its own digits each raised to the power of the number of digits

In number theory, a narcissistic number (also known as a pluperfect digital invariant (PPDI), an Armstrong number (after Michael F. Armstrong) or a plus perfect number) in a given number base [math]\displaystyle{ b }[/math] is a number that is the sum of its own digits each raised to the power of the number of digits.

Definition

Let [math]\displaystyle{ n }[/math] be a natural number. We define the narcissistic function for base [math]\displaystyle{ b \gt 1 }[/math] [math]\displaystyle{ F_{b} : \mathbb{N} \rightarrow \mathbb{N} }[/math] to be the following:

[math]\displaystyle{ F_{b}(n) = \sum_{i=0}^{k - 1} d_i^k. }[/math]

where [math]\displaystyle{ k = \lfloor \log_{b}{n} \rfloor + 1 }[/math] is the number of digits in the number in base [math]\displaystyle{ b }[/math], and

[math]\displaystyle{ d_i = \frac{n \bmod{b^{i+1}} - n \bmod b^i}{b^i} }[/math]

is the value of each digit of the number. A natural number [math]\displaystyle{ n }[/math] is a narcissistic number if it is a fixed point for [math]\displaystyle{ F_{b} }[/math], which occurs if [math]\displaystyle{ F_{b}(n) = n }[/math]. The natural numbers [math]\displaystyle{ 0 \leq n \lt b }[/math] are trivial narcissistic numbers for all [math]\displaystyle{ b }[/math], all other narcissistic numbers are nontrivial narcissistic numbers.

For example, the number 153 in base [math]\displaystyle{ b = 10 }[/math] is a narcissistic number, because [math]\displaystyle{ k = 3 }[/math] and [math]\displaystyle{ 153 = 1^3 + 5^3 + 3^3 }[/math].

A natural number [math]\displaystyle{ n }[/math] is a sociable narcissistic number if it is a periodic point for [math]\displaystyle{ F_{b} }[/math], where [math]\displaystyle{ F_{b}^p(n) = n }[/math] for a positive integer [math]\displaystyle{ p }[/math] (here [math]\displaystyle{ F_{b}^p }[/math] is the [math]\displaystyle{ p }[/math]th iterate of [math]\displaystyle{ F_b }[/math]), and forms a cycle of period [math]\displaystyle{ p }[/math]. A narcissistic number is a sociable narcissistic number with [math]\displaystyle{ p = 1 }[/math], and an amicable narcissistic number is a sociable narcissistic number with [math]\displaystyle{ p = 2 }[/math].

All natural numbers [math]\displaystyle{ n }[/math] are preperiodic points for [math]\displaystyle{ F_{b} }[/math], regardless of the base. This is because for any given digit count [math]\displaystyle{ k }[/math], the minimum possible value of [math]\displaystyle{ n }[/math] is [math]\displaystyle{ b^{k - 1} }[/math], the maximum possible value of [math]\displaystyle{ n }[/math] is [math]\displaystyle{ b^{k} - 1 \leq b^k }[/math], and the narcissistic function value is [math]\displaystyle{ F_{b}(n) = k(b-1)^k }[/math]. Thus, any narcissistic number must satisfy the inequality [math]\displaystyle{ b^{k - 1} \leq k(b-1)^k \leq b^k }[/math]. Multiplying all sides by [math]\displaystyle{ \frac{b}{(b - 1)^k} }[/math], we get [math]\displaystyle{ {\left(\frac{b}{b - 1}\right)}^{k} \leq bk \leq b{\left(\frac{b}{b - 1}\right)}^{k} }[/math], or equivalently, [math]\displaystyle{ k \leq {\left(\frac{b}{b - 1}\right)}^{k} \leq bk }[/math]. Since [math]\displaystyle{ \frac{b}{b - 1} \geq 1 }[/math], this means that there will be a maximum value [math]\displaystyle{ k }[/math] where [math]\displaystyle{ {\left(\frac{b}{b - 1}\right)}^{k} \leq bk }[/math], because of the exponential nature of [math]\displaystyle{ {\left(\frac{b}{b - 1}\right)}^{k} }[/math] and the linearity of [math]\displaystyle{ bk }[/math]. Beyond this value [math]\displaystyle{ k }[/math], [math]\displaystyle{ F_{b}(n) \leq n }[/math] always. Thus, there are a finite number of narcissistic numbers, and any natural number is guaranteed to reach a periodic point or a fixed point less than [math]\displaystyle{ b^{k} - 1 }[/math], making it a preperiodic point. Setting [math]\displaystyle{ b }[/math] equal to 10 shows that the largest narcissistic number in base 10 must be less than [math]\displaystyle{ 10^{60} }[/math].

The number of iterations [math]\displaystyle{ i }[/math] needed for [math]\displaystyle{ F_{b}^{i}(n) }[/math] to reach a fixed point is the narcissistic function's persistence of [math]\displaystyle{ n }[/math], and undefined if it never reaches a fixed point.

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

Every base [math]\displaystyle{ b \geq 3 }[/math] 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)

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.

Narcissistic numbers and cycles of F_b for specific b

All numbers are represented in base [math]\displaystyle{ b }[/math]. '#' is the length of each known finite sequence.

[math]\displaystyle{ b }[/math]	Narcissistic numbers	#	Cycles	OEIS sequence(s)
2	0, 1	2	[math]\displaystyle{ \varnothing }[/math]
3	0, 1, 2, 12, 22, 122	6	[math]\displaystyle{ \varnothing }[/math]
4	0, 1, 2, 3, 130, 131, 203, 223, 313, 332, 1103, 3303	12	[math]\displaystyle{ \varnothing }[/math]	A010344 and A010343
5	0, 1, 2, 3, 4, 23, 33, 103, 433, 2124, 2403, 3134, 124030, 124031, 242423, 434434444, ...	18	1234 → 2404 → 4103 → 2323 → 1234 3424 → 4414 → 11034 → 20034 → 20144 → 31311 → 3424 1044302 → 2110314 → 1044302 1043300 → 1131014 → 1043300	A010346
6	0, 1, 2, 3, 4, 5, 243, 514, 14340, 14341, 14432, 23520, 23521, 44405, 435152, 5435254, 12222215, 555435035 ...	31	44 → 52 → 45 → 105 → 330 → 130 → 44 13345 → 33244 → 15514 → 53404 → 41024 → 13345 14523 → 32253 → 25003 → 23424 → 14523 2245352 → 3431045 → 2245352 12444435 → 22045351 → 30145020 → 13531231 → 12444435 115531430 → 230104215 → 115531430 225435342 → 235501040 → 225435342	A010348
7	0, 1, 2, 3, 4, 5, 6, 13, 34, 44, 63, 250, 251, 305, 505, 12205, 12252, 13350, 13351, 15124, 36034, 205145, 1424553, 1433554, 3126542, 4355653, 6515652, 125543055, ...	60		A010350
8	0, 1, 2, 3, 4, 5, 6, 7, 24, 64, 134, 205, 463, 660, 661, 40663, 42710, 42711, 60007, 62047, 636703, 3352072, 3352272, ...	63		A010354 and A010351
9	0, 1, 2, 3, 4, 5, 6, 7, 8, 45, 55, 150, 151, 570, 571, 2446, 12036, 12336, 14462, 2225764, 6275850, 6275851, 12742452, ...	59		A010353
10	0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, 54748, 92727, 93084, 548834, ...	89		A005188
11	0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, 56, 66, 105, 307, 708, 966, A06, A64, 8009, 11720, 11721, 12470, ...	135		A0161948
12	0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, 25, A5, 577, 668, A83, 14765, 938A4, 369862, A2394A, ...	88		A161949
13	0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, 14, 36, 67, 77, A6, C4, 490, 491, 509, B85, 3964, 22593, 5B350, ...	202		A0161950
14	0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, 136, 409, 74AB5, 153A632, ...	103		A0161951
15	0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, 78, 88, C3A, D87, 1774, E819, E829, 7995C, 829BB, A36BC, ...	203		A0161952
16	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, 8C0, 8C1, 99A, AA9, AC3, CA8, E69, EA0, EA1, B8D2, 13579, 2B702, 2B722, 5A07C, 5A47C, C00E0, C00E1, C04E0, C04E1, C60E7, C64E7, C80E0, C80E1, C84E0, C84E1, ...	294		A161953

Extension to negative integers

Narcissistic numbers can be extended to the negative integers by use of a signed-digit representation to represent each integer.

Programming example

Python

The example below implements the narcissistic function described in the definition above to search for narcissistic functions and cycles in Python.

def ppdif(x, b):
    y = x
    digit_count = 0
    while y > 0:
        digit_count = digit_count + 1
        y = y // b
    total = 0
    while x > 0:
        total = total + pow(x % b, digit_count)
        x = x // b
    return total

def ppdif_cycle(x, b):
    seen = []
    while x not in seen:
        seen.append(x)
        x = ppdif(x, b)
    cycle = []
    while x not in cycle:
        cycle.append(x)
        x = ppdif(x, b)
    return cycle

The following Python program determines whether the integer entered is a Narcissistic / Armstrong number or not.

def no_of_digits(num):
   i = 0
   while num > 0:
       num //= 10
       i+=1

   return i

def required_sum(num):

   i = no_of_digits(num)
   s = 0
   
   while num > 0:
       digit = num % 10
       num //= 10
       s += pow(digit, i)
       
   return s

num = int(input("Enter number:"))
s = required_sum(num)
if s == num:

   print("Armstrong Number")

else:

    print("Not Armstrong Number")

Java

The following Java program determines whether the integer entered is a Narcissistic / Armstrong number or not.

import java.util.Scanner;

public class ArmstrongNumber {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        System.out.println("Enter a positive integer: ");
        int number = in.nextInt();

        if (isArmstrongNumber(number)) {
            System.out.println(number + " is an Armstrong number.");
        } else {
            System.out.println(number + " is not an Armstrong number.");
        }
    }

    public static boolean isArmstrongNumber(int number) {
        int sum = 0;
        String numberString = Integer.toString(number);
        int numberOfDigits = numberString.length();

        for (int i = 0; i < numberOfDigits; i++) {
            int digit = Character.getNumericValue(numberString.charAt(i));
            sum += Math.pow(digit, numberOfDigits);
        }

        return sum == number;
    }
}

C#

The following C# program determines whether the integer entered is a Narcissistic / Armstrong number or not.

using System;

public class Program
{
    public static void Main()
    {
        Console.WriteLine("Enter the number:");
        int value = int.Parse(Console.ReadLine());

        if (value == RequiredSum(value))
        {
            Console.WriteLine("Armstrong Number");
        }
        else 
        {
            Console.WriteLine("Not an Armstrong Number");
        }
    }

    private static int CountDigits(int num)
    {
        int i = 0; 
        for (;num > 0; ++i) num /= 10;

        return i;    
    }

    private static int RequiredSum(int num)
    {
        int count = CountDigits(num);

        int sum = 0;
        while (num > 0)
        {
            sum += (int)Math.Pow(num % 10, count);
            num /= 10;
        }

        return sum;
    }
}

C

The following C program determines whether the integer entered is a Narcissistic / Armstrong number or not.

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

int getNumberOfDigits(int n);
bool isArmstrongNumber(int candidate);

int main()
{
    int userNumber = 0;
    printf("Enter a number to verify if it is an Armstrong number: ");
    scanf("%d", &userNumber);
    printf("Is %d an Armstrong number?: %s\n", userNumber,  isArmstrongNumber(userNumber) ? "true" : "false");
    return 0;
}

bool isArmstrongNumber(int candidate)
{
    int numberOfDigits = getNumberOfDigits(candidate);
    int sum = 0;
    for (int i = candidate; i != 0; i /= 10)
    {
	    int num = i % 10;
	    int n = 1;
	    for (int j = 0; j < numberOfDigits; j++)
		{
			n *= num;
		}
	    sum += n;
    }
    return sum == candidate;
}

int getNumberOfDigits(int n)
{
    int sum = 0;
    while (n != 0)
    {
        n /= 10;
        ++sum;
    }
    return sum;
}

C++

The following C++ program determines whether the Integer entered is a Narcissistic / Armstrong number or not.

#include <iostream>
#include <cmath>

bool isNarcissistic(long n) {
    std::string s = std::to_string(n); // creating a string copy of n
    unsigned short l = s.length(); // getting the length of n
    unsigned short i = 0; long sum = 0; unsigned short base; // i will be used for iteration, sum is the sum of all of the digits to the power of the length of the number, and the base is the nth digit of n
    while (i<l) { // iterating over every digit of n
        base = s.at(i) - 48; // initializing the base of the number and subtracting 48 because the ascii for 0 is 48 and the ascii for 9 is 57 so if we subtract 48 it will give a integer version of that character.
        sum += pow(base,l); // adding base^length to the sum variable
        i++; // incrementing the iterator
    }
    return (n==sum) ? true : false; // if the n is equal to the sum return true, else, return false
}
int main() {
    unsigned int candidate; // declaring the candidate variable
    std::cout << "Enter a number to verify whether or not it is a narcissistic number: "; // printing the prompt to gather the input for the candidate variable.
    std::cin >> candidate; // taking the user's input
    std::cout << (std::string)((isNarcissistic(candidate)) ? "Yes" : "No") << std::endl; // printing "Yes" if it is an armstrong number and printing "No" if it isn't
    return 0; // returning 0 for a success
}

Ruby

The following Ruby program determines whether the integer entered is a Narcissistic / Armstrong number or not.

def narcissistic?(value) #1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153
  nvalue = []
  nnum = value.to_s
  nnum.each_char do |num|
    nvalue << num.to_i
    end
  sum = 0
  i = 0
  while sum <= value
    nsum = 0
    nvalue.each_with_index do |num,idx|
      nsum += num ** i
    end
    if nsum == value
      return true
    else
      i += 1
      sum += nsum
    end
  end
return false
end

JavaScript

The following JavaScript program determines whether the integer entered is a Narcissistic / Armstrong number or not.

function narcissistic(number) {
  const numString = number.toString();
    const numDigits = numString.length;
    let sum = 0;

    for (let digit of numString) {
      sum += Math.pow(parseInt(digit), numDigits);
    }

    return sum === number;
}

See also

• Arithmetic dynamics
• Dudeney number
• Factorion
• Happy number
• Kaprekar's constant
• Kaprekar number
• Meertens number
• Perfect digit-to-digit invariant
• Perfect digital invariant
• Sum-product number

References

• 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

• Digital Invariants
• Armstrong Numbers
• Armstrong Numbers in base 2 to 16
• Armstrong numbers between 1-999 calculator