霓虹灯，埃米尔普，Prime，Armstrong，Prime，Sum，Reverse -Numbers

来到golang学习网的大家，相信都是编程学习爱好者，希望在这里学习文章相关编程知识。下面本篇文章就来带大家聊聊《霓虹灯，埃米尔普，Prime，Armstrong，Prime，Sum，Reverse -Numbers》，介绍一下，希望对大家的知识积累有所帮助，助力实战开发！

>数字总和
>

package afterfeb4;

public class sumofnumber {
    public static void main(string[] args) {
        int no = 96785;
        int sum = 0;
        while (no > 0) {
            sum = sum + no % 10;
            no = no / 10;
        }
        system.out.println("sum of number = " + sum);
    }

}

输出： 数字总和= 35

反向词：>

package afterfeb4;

public class reversenumber {
    public static void main(string[] args) {
        int no = 12345;
        int reverse = 0;
        int count = 0;
        while (no > 0) {
            reverse = (reverse * 10) + no % 10;// 54321
            no = no / 10;// 1234 123 12 1
            count++;
        }
        system.out.println("reverse = " + reverse);
        system.out.println("count = " + count);
    }

}

输出： 反向= 54321
计数= 5

> palindrome反向相同的含义ex; mam ex; 414
>

package afterfeb4;

public class palindrome {
    public static void main(string[] args) {
        int no1 = 414;
        int no2 = no1;// no2=414
        int reverse = 0;
        while (no1 > 0) {
            reverse = (reverse * 10) + no1 % 10;
            no1 = no1 / 10;
        }
        if (reverse == no2)// if we give no1 it will give not palindrome because no1 is decease to zero
            system.out.println("palindrome");
        else
            system.out.println("not palindrome");
    }

}

输出：
palindrome

armstrongnumber

armstrong号是一个正数的正数，等于其数字的mth权力之和。它也被称为pluperfect或plus完美或自恋的数字。 让我们通过一个例子理解它。
阿姆斯特朗编号示例

1：11 = 1

2：21 = 2

3：31 = 3

153：13 53 33 = 1 125 27 = 153

125：13 23 53 = 1 8 125 = 134（不是armstrong号）

> 1634：14 64 34 44 = 1 1296 81 256 = 1643

参考： https://www.javatpoint.com/armstrong-number-in-java
>

package afterfeb4;

public class amstrongnumber {
    public static void main(string[] args) {
        int no1 = 153;
        int no2 = no1;
        int armstrong = 0;
        while (no1 > 0) {
            int a = no1 % 10;
            armstrong = armstrong + (a * a * a);
            no1 = no1 / 10;

        }
        system.out.println(armstrong);
        if (armstrong == no2)
            system.out.println("armstrong");
        else
            system.out.println("not armstrong");
    }

}

输出：
153
阿姆斯特朗

neonnumber：> 霓虹灯号

霓虹灯号的示例>>

中的霓虹灯号码

>查找霓虹灯号的步骤>

package afterfeb4;

public class neonnumber {
    public static void main(string[] args) {
        int no1 = 9;
        int no2 = no1 * no1;// 9*9=*81=1+8=9 //81--> into loop then 8
        int neon = 0;

        while (no2 > 0) {

            neon = (neon) + no2 % 10;// 1 8
            no2 = no2 / 10;// 81---->8

        }
        system.out.println("number = "+neon);
        if (no1 == neon)
            system.out.println("neonnumber");
        else
            system.out.println("not neonnumber");

    }

}

package afterfeb4;

public class emirpnumber {
    public static void main(string[] args) {
        int no =13;
        int emirp = 0;//13 --> 31reverse of no aslo a prime number
        while (no > 0) {
            emirp = (emirp * 10) + no % 10;
            no = no / 10;

        }
        system.out.println(emirp);
        if (emirp % 2 != 0 && emirp%3!=0 )
            system.out.println("emirpnumber");
        else
            system.out.println("not emirpnumber");
    }

}

package Afterfeb4;

public class primeNumber {
    public static void main(String[] args) {

            int no =5;
            if (no% 2 != 0 && no%3!=0  )
                System.out.println("primeNumber");
            else
                System.out.println("NOt primeNumber");
        }

    }