0% found this document useful (0 votes)
165 views2 pages

ICSE Class 10 Java Number Programs

Uploaded by

sidshah925
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
0% found this document useful (0 votes)
165 views2 pages

ICSE Class 10 Java Number Programs

Uploaded by

sidshah925
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

ICSE Class 10 Computer Applications - Java Number Program Questions

1. Check Armstrong Number

Write a program to input a number and check whether it is an Armstrong number or not.

(Example: 153 = 1^3 + 5^3 + 3^3)

2. Prime Number Check

Accept a number from the user and check whether it is a prime number or not.

3. Reverse a Number

Write a program to input a number and print its reverse. (Example: 1234 -> 4321)

4. Palindrome Number

Input a number and check whether it is a palindrome. (Example: 121, 1331)

5. Perfect Number

Accept a number and check whether it is a Perfect Number.

(Example: 28 = 1 + 2 + 4 + 7 + 14)

6. Automorphic Number

Accept a number and check whether it is an automorphic number or not.

(Example: 76 -> 76^2 = 5776)

7. Fibonacci Series (N terms)

Write a program to print the first N terms of the Fibonacci series.

(Example: 0, 1, 1, 2, 3, 5, 8...)

8. Sum of Digits

Write a program to input a number and print the sum of its digits. (Example: 123 -> 6)

9. HCF and LCM

Accept two numbers and find their HCF (GCD) and LCM using loops.

10. Display All Prime Numbers in a Range

Input two numbers and print all the prime numbers between them.

Page 1
ICSE Class 10 Computer Applications - Java Number Program Questions

11. Disarium Number Check

A number is Disarium if sum of its digits powered with their position is equal to the number.

(Example: 135 = 1^1 + 3^2 + 5^3 = 135)

12. Strong Number Check

A Strong number is one whose sum of the factorial of digits is equal to the number.

(Example: 145 = 1! + 4! + 5! = 145)

Page 2

You might also like