Base | Representation |
---|---|
bin | 11100000101110110… |
… | …110101000001110001 |
3 | 2212212010001200200001 |
4 | 130011312311001301 |
5 | 443233213431004 |
6 | 21505014230001 |
7 | 2115316345231 |
oct | 340566650161 |
9 | 85763050601 |
10 | 30163030129 |
11 | 11879275a81 |
12 | 5a19655301 |
13 | 2ac90a6b2b |
14 | 1661d65cc1 |
15 | bb80ce1a4 |
hex | 705db5071 |
30163030129 has 2 divisors, whose sum is σ = 30163030130. Its totient is φ = 30163030128.
The previous prime is 30163030109. The next prime is 30163030151. The reversal of 30163030129 is 92103036103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27298639729 + 2864390400 = 165223^2 + 53520^2 .
It is a cyclic number.
It is not a de Polignac number, because 30163030129 - 211 = 30163028081 is a prime.
It is a super-3 number, since 3×301630301293 (a number of 32 digits) contains 333 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 30163030097 and 30163030106.
It is not a weakly prime, because it can be changed into another prime (30163030109) 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, 15081515064 + 15081515065.
It is an arithmetic number, because the mean of its divisors is an integer number (15081515065).
Almost surely, 230163030129 is an apocalyptic number.
It is an amenable number.
30163030129 is a deficient number, since it is larger than the sum of its proper divisors (1).
30163030129 is an equidigital number, since it uses as much as digits as its factorization.
30163030129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 30163030129 in words is "thirty billion, one hundred sixty-three million, thirty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •