Base | Representation |
---|---|
bin | 11100010100101000… |
… | …111010110011100001 |
3 | 2220111101202000000112 |
4 | 130110220322303201 |
5 | 444240211321032 |
6 | 21545354101105 |
7 | 2124420410036 |
oct | 342450726341 |
9 | 86441660015 |
10 | 30411042017 |
11 | 11996270a84 |
12 | 5a8871a795 |
13 | 2b385a1625 |
14 | 1686c8538d |
15 | bcec6e1b2 |
hex | 714a3ace1 |
30411042017 has 2 divisors, whose sum is σ = 30411042018. Its totient is φ = 30411042016.
The previous prime is 30411042001. The next prime is 30411042019. The reversal of 30411042017 is 71024011403.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30376655521 + 34386496 = 174289^2 + 5864^2 .
It is an emirp because it is prime and its reverse (71024011403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30411042017 - 24 = 30411042001 is a prime.
Together with 30411042019, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 30411041983 and 30411042001.
It is not a weakly prime, because it can be changed into another prime (30411042019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15205521008 + 15205521009.
It is an arithmetic number, because the mean of its divisors is an integer number (15205521009).
Almost surely, 230411042017 is an apocalyptic number.
It is an amenable number.
30411042017 is a deficient number, since it is larger than the sum of its proper divisors (1).
30411042017 is an equidigital number, since it uses as much as digits as its factorization.
30411042017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
The spelling of 30411042017 in words is "thirty billion, four hundred eleven million, forty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •