Java: Check whether a number is an Armstrong Number or not

Last update on May 15 2025 13:10:00 (UTC/GMT +8 hours)

Check Armstrong Number

Write a Java program to check whether a number is an Armstrong Number or not.

Armstrong (Michael F. Armstrong) number is a number that is equal to the sum of cubes of its digits. For example 0, 1, 153, 370, 371 and 407 are the Armstrong numbers

Sample Solution:

Java Code:

import java.util.*;
public class solution {	
 public static boolean is_Amstrong(int n) {
        int remainder, sum = 0, temp = 0;
        temp = n;
        while (n > 0) {
            remainder = n % 10;
            sum = sum + (remainder * remainder * remainder);
            n = n / 10;
        }
        return sum == temp;
    }  

   public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("Input an integer: ");
		String input = scanner.nextLine();
		int number = Integer.parseInt(input); 
		System.out.println("Is Armstrong number? "+is_Amstrong(number));		
		}
 }

Sample Output:

Input an integer:  153
Is Armstrong number? true

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to check if a number is Armstrong by computing the sum of each digit raised to the power of the number of digits without converting it to a string.
• Write a Java program to generate all Armstrong numbers within a specified range using iterative methods.
• Write a Java program to compare Armstrong number detection using recursion versus iteration.
• Write a Java program to optimize Armstrong number checking by precomputing and caching the powers of digits 0–9.

Go to:

• Java Numbers Exercises Home ↩
• Java Exercises Home ↩

PREV : First 20 Hamming Numbers.
NEXT : Check Lucky Number.

Java Code Editor:

Contribute your code and comments through Disqus.