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,844 questions

51,765 answers

573 users

How to sum the digits of the number 2^N in Scala

1 Answer

0 votes
object PowerDigitSum {
  def sumOfDigits(n: Int): Int = {
    val power = BigInt(2).pow(n)
    power.toString.map(_.asDigit).sum
  }

  def main(args: Array[String]): Unit = {
    val testCases = List(15, 100, 1000)
    for (n <- testCases) {
      println(s"Sum of digits of 2^$n is: ${sumOfDigits(n)}")
    }
  }
}




/*
run:
 
Sum of digits of 2^15 is: 26
Sum of digits of 2^100 is: 115
Sum of digits of 2^1000 is: 1366
 
*/
 

 



answered Aug 2, 2025 by avibootz
...