Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,912 questions

51,844 answers

573 users

How to find the prime factors of a number in Kotlin

1 Answer

0 votes
fun getPrimeFactors(n: Int): List<Int> {
    val factors = mutableListOf<Int>()
    var number = n
    var divisor = 2

    while (number >= 2) {
        if (number % divisor == 0) {
            factors.add(divisor)
            number /= divisor
        } else {
            divisor++
        }
    }

    return factors
}

fun main() {
    println("124 = ${getPrimeFactors(124).joinToString(" x ")}")
    println("288 = ${getPrimeFactors(288).joinToString(" x ")}")
    println("1288 = ${getPrimeFactors(1288).joinToString(" x ")}")
}

 
  
/*
run:
 
124 = 2 x 2 x 31
288 = 2 x 2 x 2 x 2 x 2 x 3 x 3
1288 = 2 x 2 x 2 x 7 x 23

*/

 



answered Jul 29, 2025 by avibootz
...