🧮Java Numbers Programs

Determines whether a number's proper divisors add up to more than the number itself.

Determines whether a number equals the sum of its own digits raised to the digit count.

Determines whether a number appears as the trailing digits of its own square.

Determines whether two numbers share no common factor besides 1.

Determines whether a number's proper divisors add up to less than the number itself.

Determines whether a number's binary representation has an even number of 1 bits.

Determines whether a number is a magic number.

Determines whether a number's binary representation has an odd number of 1 bits.

Determines whether a number reads the same forwards and backwards.

Determines whether a number equals the sum of its own proper divisors.

Determines whether a number equals the sum of the factorials of its own digits.

Determines whether two numbers form a twin prime pair.

Counts how many prime numbers fall between a lower and upper bound.

Finds the greatest common divisor of two numbers.

Finds the least common multiple of two numbers.

Finds the smallest prime number that divides a number evenly.

Adds up every prime number within a range.

Lists every Armstrong number within a given range.

Lists every automorphic number within a given range.

Lists every prime number between a lower and upper bound.

Calculates the number of ways to choose r items from n, where order doesn't matter.

Calculates the number of ways to arrange r items chosen from n, where order matters.

Computes base raised to an exponent using recursion.

Determines whether every digit-rotation of a number is also prime.

Determines whether a number is prime, and its digit-reversal is a different prime.

Determines whether a given number is itself a Fibonacci number.

Determines whether repeatedly summing the squares of a number's digits eventually reaches 1.

Determines whether a number is a Kaprekar number.

Computes the single Fibonacci number sitting at an arbitrary position.

Finds the greatest common divisor shared by every number in an array.

Finds the biggest prime number that divides a number evenly.

Finds the least common multiple shared by every number in an array.

Finds the Nth prime number by counting primes as it scans upward.

Generates and prints the first N rows of Pascal's triangle.

Breaks a number down into its full product of prime factors.

Lists every happy number within a given range.

Lists every perfect number within a range.

Lists every strong number within a given range.

Lists every twin prime pair up to a given limit.

Determines whether a number reappears in a Fibonacci-like sequence seeded by its own digits.

Computes the Nth number in the Catalan sequence.