is self divisor java

A self-divisor is a positive integer that is divisible by all of its digits. For example, the positive integers 128, 22, and 11 are self-divisors, because they are divisible by 1, 2, and 8, 2, and 2, and 1 and 1, respectively.

To determine if a positive integer is a self-divisor in Java, you can write a function that takes an integer as an argument and checks if it is divisible by each of its digits. Here is an example of how to do this in Java:

public static boolean isSelfDivisor(int n) {
    int m = n;
    while (m > 0) {
        int d = m % 10;
        if (d == 0 || n % d != 0) return false;
        m /= 10;
    }
    return true;
}

This function uses a loop to iterate over the digits of the integer n, checking if each digit is a divisor of n. If any of the digits is 0 or is not a divisor of n, the function returns false. If the loop completes without returning false, the function returns true, indicating that n is a self-divisor.

To use this function, you can call it with an integer as an argument, like this:

int n = 128;
if (isSelfDivisor(n)) {
    System.out.println(n + " is a self-divisor.");
} else {
    System.out.println(n + " is not a self-divisor.");
}

This will output "128 is a self-divisor." to the console.

For more information on self-divisors and how to determine if a positive integer is a self-divisor, you can refer to online resources or books on the subject.