Base | Representation |
---|---|
bin | 11100001110001101… |
… | …010011010100100101 |
3 | 2220012212200222001112 |
4 | 130032031103110211 |
5 | 444030100422414 |
6 | 21530541234405 |
7 | 2121640301225 |
oct | 341615232445 |
9 | 86185628045 |
10 | 30303139109 |
11 | 11940371a21 |
12 | 5a58562a05 |
13 | 2b1c121959 |
14 | 16767d8085 |
15 | bc5557d3e |
hex | 70e353525 |
30303139109 has 2 divisors, whose sum is σ = 30303139110. Its totient is φ = 30303139108.
The previous prime is 30303139091. The next prime is 30303139117. The reversal of 30303139109 is 90193130303.
Together with previous prime (30303139091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16585576225 + 13717562884 = 128785^2 + 117122^2 .
It is an emirp because it is prime and its reverse (90193130303) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30303139109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30303139169) 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, 15151569554 + 15151569555.
It is an arithmetic number, because the mean of its divisors is an integer number (15151569555).
Almost surely, 230303139109 is an apocalyptic number.
It is an amenable number.
30303139109 is a deficient number, since it is larger than the sum of its proper divisors (1).
30303139109 is an equidigital number, since it uses as much as digits as its factorization.
30303139109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 32.
The spelling of 30303139109 in words is "thirty billion, three hundred three million, one hundred thirty-nine thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •