Java Basic
Java Interview Programs
- Java Interview Programs
- Java Abundant Number
- Java Amicable Number
- Java Armstrong Number
- Java Average of N Numbers
- Java Automorphic Number
- Java Biggest of three numbers
- Java Binary to Decimal
- Java Common Divisors
- Java Composite Number
- Java Condense a Number
- Java Cube Number
- Java Decimal to Binary
- Java Decimal to Octal
- Java Disarium Number
- Java Even Number
- Java Evil Number
- Java Factorial of a Number
- Java Fibonacci Series
- Java GCD
- Java Happy Number
- Java Harshad Number
- Java LCM
- Java Leap Year
- Java Magic Number
- Java Matrix Addition
- Java Matrix Division
- Java Matrix Multiplication
- Java Matrix Subtraction
- JS Matrix Transpose
- Java Maximum Value of an Array
- Java Minimum Value of an Array
- Java Multiplication Table
- Java Natural Number
- Java Number Combination
- Java Odd Number
- Java Palindrome Number
- Java Pascalβs Triangle
- Java Perfect Number
- Java Perfect Square
- Java Power of 2
- Java Power of 3
- Java Pronic Number
- Java Prime Factor
- Java Prime Number
- Java Smith Number
- Java Strong Number
- Java Sum of Array
- Java Sum of Digits
- Java Swap Two Numbers
- Java Triangular Number
Java Program to Check Strong Number
Photo Credit to CodeToFun
π Introduction
In the world of programming, exploring number properties is a fascinating journey. One such property is related to Strong Numbers.
A Strong Number (also known as a Digital Factorial) is a number in which the sum of the factorials of its digits is equal to the number itself.
In this tutorial, we'll delve into a Java program that checks whether a given number is a Strong Number or not.
π Example
Let's take a look at the Java code that checks whether a given number is a Strong Number.
public class StrongNumberChecker {
// Function to calculate the factorial of a number
static int factorial(int num) {
if (num == 0 || num == 1) {
return 1;
} else {
return num * factorial(num - 1);
}
}
// Function to check if a number is a Strong Number
static boolean isStrongNumber(int num) {
int originalNum = num;
int sum = 0;
while (num > 0) {
int digit = num % 10;
sum += factorial(digit);
num /= 10;
}
return (sum == originalNum);
}
// Driver program
public static void main(String[] args) {
// Replace this value with your desired number
int number = 145;
// Call the function to check if the number is a Strong Number
if (isStrongNumber(number)) {
System.out.println(number + " is a Strong Number.");
} else {
System.out.println(number + " is not a Strong Number.");
}
}
}
π» Testing the Program
To test the program with different numbers, simply replace the value of number in the main method.
145 is a Strong Number.
Compile and run the program to check if the number is a Strong Number.
π§ How the Program Works
- The program defines a class StrongNumberChecker containing a static method factorial to calculate the factorial of a number.
- Another static method isStrongNumber is defined to check if a given number is a Strong Number.
- Inside the isStrongNumber method, it iterates through each digit of the number, calculates the factorial, and adds it to the sum.
- The result is compared with the original number to determine if it is a Strong Number.
π Between the Given Range
Let's take a look at the java code that checks for strong numbers in the range of 1 to 200.
public class StrongNumberChecker {
// Function to calculate the factorial of a number
static int factorial(int n) {
if (n == 0 || n == 1) {
return 1;
} else {
return n * factorial(n - 1);
}
}
// Function to check if a number is a Strong Number
static boolean isStrongNumber(int num) {
int originalNum = num;
int sum = 0;
while (num > 0) {
int digit = num % 10;
sum += factorial(digit);
num /= 10;
}
return sum == originalNum;
}
// Driver program
public static void main(String[] args) {
System.out.print("Strong Numbers in the Range 1 to 200:\n");
for (int i = 1; i <= 200; i++) {
if (isStrongNumber(i)) {
System.out.print(i + " ");
}
}
}
}
π» Testing the Program
Strong Numbers in the Range 1 to 200: 1 2 145
Run the program to see the strong numbers in the range of 1 to 200.
π§ How the Program Works
- The program defines a class StrongNumberChecker with two static methods: factorial to calculate the factorial of a number and isStrongNumber to check if a number is a Strong Number.
- Inside the main method, it iterates through numbers from 1 to 200.
- For each number, it checks if it is a Strong Number using the isStrongNumber method.
- If a number is a Strong Number, it is printed.
π§ Understanding the Concept of Strong Number
To determine if a number is a Strong Number, we need to calculate the factorial of each digit of the number and then sum these factorials. If the sum is equal to the original number, then it is a Strong Number.
For example, let's consider the number 145:
- The factorial of 1 is 1.
- The factorial of 4 is 24.
- The factorial of 5 is 120.
The sum of these factorials is 1 + 24 + 120 = 145, which is the original number. Hence, 145 is a Strong Number.
π Conclusion
Understanding and implementing programs that check for mathematical properties, such as Strong Numbers, enhances problem-solving skills in programming. Feel free to modify and expand upon this code for your specific needs. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (Java Program to Check Strong Number), please comment here. I will help you immediately.