# How to check whether given number is Armstrong or not in Java?

##
__Problem Description__ :

Write a program in Java that checks whether given number is Armstrong or not.

Number is Armstrong or not? |

##

Concept :

Concept

Armstrong number is a number that is equal to the sum of cubes of its digits. For example 153 because 153 = 1*1*1 + 5*5*5 + 3*3*3.

##
__Java Program__ :

##
__Output__ :

## Case 1 :

Given number is not Armstrong |

### Case 2 :

Given number is Armstrong |

##
__You might also like__ :

**How to find factorial of large number?**

**How to generate divisors of any given number?**

**How to generate first N triangular numbers?**

**How to generate first N pentagonal numbers?**

**How to generate first N hexagonal numbers?**

##
__References__ :

http://docs.oracle.com/javase/7/docs/api/java/lang/String.html

Thank you friends, I hope you have clearly understood the solution of this problem. If you have any doubt, suggestion or query please feel free to comment below. You can also discuss this solution in our forum.

**Tags : Number Problems, Armstrong Number, if else statement, for loop, String, Regular expressions, Mathematics Problem.**

How to check whether given number is Armstrong or not in Java?
Reviewed by Rohit Agarwal
on
3/10/2017
Rating:

Explanation on armstrong concept is good. Thanks for sharing.

ReplyDeleteCheers,

http://www.flowerbrackets.com/armstrong-number-in-java-program/