Scribd
Upload
3 views

Number based questions answers

The document is a Java program that checks various properties of a number input by the user, including whether it is an Armstrong, Perfect, Palindrome, Prime, Strong, Harshad, Automorphic, Happy, Kaprekar, Duck, Spy, Neon, Evil, or Buzz number. It contains methods for each property that perform the necessary calculations and checks. The program utilizes a Scanner for user input and outputs the results for each property.

Uploaded by

fortfire.godgamers
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Number based questions answers

The document is a Java program that checks various properties of a number input by the user, including whether it is an Armstrong, Perfect, Palindrome, Prime, Strong, Harshad, Automorphic, Happy, Kaprekar, Duck, Spy, Neon, Evil, or Buzz number. It contains methods for each property that perform the necessary calculations and checks. The program utilizes a Scanner for user input and outputs the results for each property.

Uploaded by

fortfire.godgamers
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

import java.util.

Scanner;

public class Numberprograms

void main(String[] args) {

Scanner scanner = new Scanner(System.in);

System.out.println("Enter a number to check properties:");

int number = scanner.nextInt();

System.out.println("Checking properties for number: " + number);

System.out.println("1. Armstrong Number: " + isArmstrong(number));

System.out.println("2. Perfect Number: " + isPerfect(number));

System.out.println("3. Palindrome Number: " + isPalindrome(number));

System.out.println("4. Prime Number: " + isPrime(number));

System.out.println("5. Strong Number: " + isStrong(number));

System.out.println("6. Harshad (Niven) Number: " + isHarshad(number));

System.out.println("7. Automorphic Number: " + isAutomorphic(number));

System.out.println("8. Happy Number: " + isHappy(number));

System.out.println("9. Kaprekar Number: " + isKaprekar(number));

System.out.println("10. Duck Number: " + isDuck(number));

System.out.println("11. Spy Number: " + isSpy(number));

System.out.println("12. Neon Number: " + isNeon(number));

System.out.println("13. Evil Number: " + isEvil(number));

System.out.println("14. Buzz Number: " + isBuzz(number));


}

boolean isArmstrong(int num) {

int sum = 0, temp = num, digits = 0;

while (temp > 0)

digits++; temp /= 10;

temp = num;

while (temp > 0)

int digit = temp % 10;

sum += Math.pow(digit, digits);

temp /= 10;

return sum == num;

boolean isPerfect(int num) {

int sum = 0;

for (int i = 1; i <= num / 2; i++) {

if (num % i == 0) sum += i;

return sum == num;

boolean isPalindrome(int num) {

int reversed = 0, original = num;


while (num > 0) {

reversed = reversed * 10 + num % 10;

num /= 10;

return reversed == original;

boolean isPrime(int num) {

if (num <= 1) return false;

for (int i = 2; i <= Math.sqrt(num); i++) {

if (num % i == 0) return false;

return true;

boolean isStrong(int num) {

int sum = 0, temp = num;

while (temp > 0) {

int digit = temp % 10;

sum += factorial(digit);

temp /= 10;

return sum == num;

boolean isHarshad(int num) {

int sum = 0, temp = num;

while (temp > 0) {


sum += temp % 10;

temp /= 10;

return num % sum == 0;

boolean isAutomorphic(int num) {

int square = num * num;

return String.valueOf(square).endsWith(String.valueOf(num));

boolean isHappy(int num) {

int slow = num, fast = num;

do {

slow = sumOfSquares(slow);

fast = sumOfSquares(sumOfSquares(fast));

} while (slow != fast);

return slow == 1;

boolean isKaprekar(int num) {

int square = num * num;

String str = String.valueOf(square);

int len = str.length();

int left = len > 1 ? Integer.parseInt(str.substring(0, len / 2)) : 0;

int right = Integer.parseInt(str.substring(len / 2));

return left + right == num;

}
boolean isDuck(int num) {

String str = String.valueOf(num);

return str.contains("0") && str.charAt(0) != '0';

boolean isSpy(int num) {

int sum = 0, product = 1, temp = num;

while (temp > 0) {

int digit = temp % 10;

sum += digit;

product *= digit;

temp /= 10;

return sum == product;

boolean isNeon(int num) {

int square = num * num, sum = 0;

while (square > 0) {

sum += square % 10;

square /= 10;

return sum == num;

boolean isEvil(int num) {

String binary = Integer.toBinaryString(num);

int count = 0;
for (char c : binary.toCharArray()) {

if (c == '1') count++;

return count % 2 == 0;

boolean isBuzz(int num) {

return num % 7 == 0 || num % 10 == 7;

int factorial(int n) {

int fact = 1;

for (int i = 1; i <= n; i++) {

fact *= i;

return fact;

int sumOfSquares(int num) {

int sum = 0;

while (num > 0) {

int digit = num % 10;

sum += digit * digit;

num /= 10;

return sum;

You might also like