Write a Program in Java to input a number in Decimal number system and convert it into its equivalent number in the Binary number system.

Read More »# Number Related Programs

## Program to check for Duck Number

Write a Program in Java to input a number and check whether it is a **Duck Number** or not.

## Java Program to check for Unique Number

A Unique number is a positive integer (without leading zeros) with no duplicate digits. For example 7, 135, 214 are all unique numbers whereas 33, 3121, 300 are not.

Read More »## [Question 8] ISC 2013 (Theory) Paper Solved – Emirp Number

An Emirp number is a number which is prime backwards and forwards. Example: 13 and 31 are both prime numbers. Thus, 13 is an Emirp number. Design a class Emirp to check if a given number is Emirp number or not.

Read More »## ISC 2013 [Question 1] Practical Paper Solved (ISBN Number)

An ISBN (International Standard Book Number) is a ten digit code which uniquely identifies a book. The first nine digits represent the Group, Publisher and Title of the book and the last digit is used to check whether ISBN is correct or not. Each of the first nine digits of the code can take a value between 0 and 9. Sometimes it is necessary to make the last digit equal to ten; this is done by writing the last digit of the code as X. To verify an ISBN, calculate 10 times the first digit, plus 9 times the second digit, plus 8 times the third and so on until we add 1 time the last digit. If the final number leaves no remainder when divided by 11, the code is a valid ISBN. Design a program to accept a ten digit code from the user. For an invalid input, display an appropriate message.

Read More »## Program for Generating Lucky Numbers (ISC 2001) – [Method 1]

This is the Java program for generating the Lucky Numbers within a given range. This is the 1st method, and it uses only one single dimensional array to generate the Lucky Numbers. Consider the sequence of natural numbers. 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 Removing every second number produces the sequences 1, 3, 5, 7, 9 Removing every third number produces the sequences 1, 3, 7,9 Removing every fourth number produces the sequences 1, 3, 7 Hence, The Lucky numbers less than 10 are: 1, 3, 7

Read More »## [Solved] Question 10 (Happy Number) – ISC 2012 Computer Science

Program to check if a given number is a happy number or not. A happy number is a number in which the eventual sum of the square of the digits of the number is equal to 1. Example: 28 [Question 10 (ISC 2012)]

Read More »## Program to Check for Kaprekar Number

Program in Java (BlueJ) to input a number and check whether it is a Kaprekar number or not. A Kaprekar number is a number, whose square is found out and the sum of the left and right part of its square (divided from its middle part) is equal to the number itself.

Read More »## Program to find the Prime Factors of a Number [Method 1]

Write a program in JAVA to find the Prime factors of a number. Prime factors of a number are those factors which are prime in nature and by which the number itself is completely divisible (1 will not be taken as prime number).

Read More »## [Question 1 (Prime Palindrome)] ISC 2012 Practical [Solved]

Java Program for Printing all the Prime palindrome numbers in the given range. Solution of Program 1 of ISC 2012 Computer Science Practical Exam.

Read More »## Program on Decimal to Roman Number Conversion [Method 2]

This is the Second Method of Converting a Decimal Number entered by the user into its Roman Equivalent. Kindly read Method 1 also. [Note: The number entered should be within the Range 1-3999]

Read More »## Program on Decimal to Roman Number Conversion [Method 1]

This is the First method of finding the Roman equivalent of any Decimal number entered by the user. [The number entered should be within the Range 1-3999]

Read More »