Base | Representation |
---|---|
bin | 11100011001111110… |
… | …101101100100000011 |
3 | 2220201122100002202101 |
4 | 130121332231210003 |
5 | 444431131003102 |
6 | 22002314331231 |
7 | 2126556112453 |
oct | 343176554403 |
9 | 86648302671 |
10 | 30500641027 |
11 | 11a318a904a |
12 | 5ab2729b17 |
13 | 2b51012bac |
14 | 1694b29d63 |
15 | bd7a6be87 |
hex | 719fad903 |
30500641027 has 2 divisors, whose sum is σ = 30500641028. Its totient is φ = 30500641026.
The previous prime is 30500640983. The next prime is 30500641099. The reversal of 30500641027 is 72014600503.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30500641027 is a prime.
It is a super-2 number, since 2×305006410272 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30500640986 and 30500641004.
It is not a weakly prime, because it can be changed into another prime (30500648027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15250320513 + 15250320514.
It is an arithmetic number, because the mean of its divisors is an integer number (15250320514).
Almost surely, 230500641027 is an apocalyptic number.
30500641027 is a deficient number, since it is larger than the sum of its proper divisors (1).
30500641027 is an equidigital number, since it uses as much as digits as its factorization.
30500641027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 28.
The spelling of 30500641027 in words is "thirty billion, five hundred million, six hundred forty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •