# Java Primality Test | HackerRank Solution

Hello coders, today we are going to solve Java Primality Test HackerRank Solution in Java.

## Problem

A prime number is a natural number greater than 1 whose only positive divisors are 1 and itself. For example, the first six prime numbers are 2, 3, 5, 7, 11, and 13.

Given a large integer, n, use the Java BigInteger class’ isProbablePrime method to determine and print whether it’s `prime` or `not prime`.

## Input Format

A single line containing an integer, n (the number to be checked).

#### Constraints

n contains at most 100 digits.

## Output Format

If n is a prime number, print prime; otherwise, print not prime.

#### Sample Input

`` 13``

#### Sample Output

`` prime``

## Solution –Java Primality Test

```import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {
public static void main(String[] args) throws IOException {