Kotlin Program to check number is prime or not

In this program, You will learn how to check number is prime or not in Kotlin.

Some list of prime numbers is : 2, 3, 5, 7, 11, 13

Example: How to check number is prime or not in Kotlin.

import java.util.Scanner

fun main(args: Array<String>) {

    var n: Int
    var p = 1
    var i = 2
    var sc = Scanner(System.`in`)

    print("Enter a number:")
    n = sc.nextInt()

    while (i < n) {
        if (n % i == 0) {
            p = 0

    if (p == 1) {
        println("Number is prime:$n")
    } else {
        println("The number is not prime:$n")


Enter a number:13
Number is prime:13

Xiith is created for educational, experimental, and schooling purpose. Examples on Xiith are made easier to make a better or basic understanding. Tutorials, testimonials, and examples are continuously checked to avoid delusion, but we cannot take complete responsibility of all programs on Xiith. When you are operating this site, you have to agree to read and accept our terms of use, cookie and privacy policy.Copyright © 2020 by Xiith. All Rights Reserved. About us.