Base | Representation |
---|---|
bin | 11100001111010011… |
… | …000101000111110011 |
3 | 2220021011010021211222 |
4 | 130033103011013303 |
5 | 444044241243102 |
6 | 21532433255255 |
7 | 2122251624356 |
oct | 341723050763 |
9 | 86234107758 |
10 | 30321431027 |
11 | 1194a725a08 |
12 | 5a6270452b |
13 | 2b22b57784 |
14 | 1678dda29d |
15 | bc6e6caa2 |
hex | 70f4c51f3 |
30321431027 has 2 divisors, whose sum is σ = 30321431028. Its totient is φ = 30321431026.
The previous prime is 30321431017. The next prime is 30321431033. The reversal of 30321431027 is 72013412303.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30321431027 - 222 = 30317236723 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30321430987 and 30321431005.
It is not a weakly prime, because it can be changed into another prime (30321431017) 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, 15160715513 + 15160715514.
It is an arithmetic number, because the mean of its divisors is an integer number (15160715514).
Almost surely, 230321431027 is an apocalyptic number.
30321431027 is a deficient number, since it is larger than the sum of its proper divisors (1).
30321431027 is an equidigital number, since it uses as much as digits as its factorization.
30321431027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 26.
The spelling of 30321431027 in words is "thirty billion, three hundred twenty-one million, four hundred thirty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •