Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Mr. Satyabrata
Page 32 of 32
How To Check Whether a Number is Tech Number or Not in Java?
A number is said to be a tech number, when an even digit number is divided into exactly two parts and the square value of the sum of those two numbers is equal to the original number. For more clarification, we take a number which has even digits. After that, divide it into two parts and add two parts. After getting the sum value, we calculate the square of it. Now we compare both the calculated square value and the original/input number. If both are same then we can say that the input number is a tech number otherwise ...
Read MoreHow To Check Whether a Number is Tcefrep Number or Not in Java?
A number is said to be a Tcefrep number, if the reverse of that number is equal to the sum of the proper divisors of the original number. For more clarification, we find the sum of the divisors of a number and find the reverse of the original number. If both the sum value and the reverse of the given number are the same then we can say that the given number is a Tcefrep number. Some examples of Tcefrep numbers are: 6, 498906, 20671542 ... etc. In this article, we will see how to check if a ...
Read MoreHow To Check Whether a Number is Strontio Number or Not in Java?
A number is said to be a Strontio number, if we multiply 2 with a four-digit number then in the resultant number the tens place and hundreds place digits are the same. In simple terms, Strontio numbers are basically four-digit numbers. When we multiply 2 with it, it results in a number whose tens place and hundred places are exactly the same. Some examples of Strontio numbers are- 1111, 2222, 3333, 4444, 5555, 6666, 7777, 8888, 9999, 1001 ... etc. In this article, we will see how to check if a number is a strontio number by using Java ...
Read MoreHow To Check Whether a Number is Pointer Prime Number or Not in Java?
A number is said to be a pointer prime number, if the sum of the product value of digits and the original prime number results in the next prime number. For more clarification, we take a prime number and multiply the digits with each other and add that multiplication value with the original number. After that if we get another prime number which is next to the original prime number. Then we can say that the number is a pointer prime number. Some examples of pointer prime numbers are: 23, 61, 1123, 1231 ... etc. In this article, ...
Read MoreHow To Find the Surface Area of Hemisphere in Java?
A hemisphere refers to the exact half of a sphere. Means if we divide a sphere in two equal parts then we will get two hemispheres. Hemisphere is a three-dimensional geometrical shape which has one flat face. There are many practical examples of hemispheres. The earth divided into 2 equal parts results 2 hemispheres i.e. Northern hemisphere and Southern hemisphere. The area occupied by the outer surface of a three-dimensional object is called the surface area. Formula to calculate surface area of hemisphere − Mathematically it can be represented as $$\mathrm{Surface \:Area \:= \:2\pi\:r^2}$$ Mathematically it can be represented as ...
Read MoreHow To Check Whether a Number is a Spy Number or Not in Java?
A number is said to be a Spy number, if the sum of the digits of the given number is equal to the product of the digits of the given number. For more clarification, we have to first calculate the sum of the digits of the given number. After that we have to calculate the product of the digits of the given number. Then we have to compare both the sum value and product value, if they are the same then the given number is a spy number otherwise it is not a spy number. In this article, we will ...
Read MoreHow To Check Whether a Number is a Special Number or Not in Java?
A number is said to be a Special number, if the sum of factorials of the input number’s every digit is equal to the same input number. For more clarification, we have to find all the factors of every digit of the given number. After that we have to calculate the sum of those factorials. Then we have to compare both the sum value and input number, if they are the same then the given number is a special number otherwise it is not a special number. In this article, we will see how to check if a number is ...
Read MoreHow to Calculate Area of Enneagon in Java?
An enneagon refers to a polygon with 9 sides with 9 internal angles. Where all the sides of the polygon are equal it is called a regular enneagon which has an internal angle of 140 degrees, and the sum of all internal angles are 1260 degrees. An enneagon is also referred to as Nonagon. Area of enneagon can be calculated by using When Length of Side (s) is given Area = 6.1818 * (s * s) When circumradius (r) is given Area = 2.8925 * (r * r) When apothem (a) is given Area = 3.2757 * (a ...
Read More