Write a program in java to accept a number and chech whether it is a palindrome number or not. Do the program without using modulus operator and String.

Sure, here is a Java program that checks if a number is a palindrome without using the modulus operator and String:

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("Enter a number: ");
        int num = scanner.nextInt();
        if (isPalindrome(num)) {
            System.out.println(num + " is a palindrome number.");
        } else {
            System.out.println(num + " is not a palindrome number.");
        }
    }

    public static boolean isPalindrome(int num) {
        int reversed = 0;
        int temp = num;
        while (temp != 0) {
            reversed = reversed * 10 + temp / 10;
            temp /= 10;
        }
        return num == reversed;
    }
}

This program works by reversing the number and then comparing the reversed number with the original number. If they are the same, then the number is a palindrome. The reversal is done by repeatedly dividing the number by 10 and adding the remainder to the reversed number.