Base | Representation |
---|---|
bin | 11100100000001101… |
… | …001101001110011011 |
3 | 2220222220220101001101 |
4 | 130200031031032123 |
5 | 1000134401312102 |
6 | 22020525332231 |
7 | 2132265043351 |
oct | 344015151633 |
9 | 86886811041 |
10 | 30605104027 |
11 | 11a85868703 |
12 | 5b21707077 |
13 | 2b69859c14 |
14 | 16a495d7d1 |
15 | be1d03e87 |
hex | 72034d39b |
30605104027 has 2 divisors, whose sum is σ = 30605104028. Its totient is φ = 30605104026.
The previous prime is 30605104021. The next prime is 30605104081. The reversal of 30605104027 is 72040150603.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 30605104027 - 27 = 30605103899 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30605103986 and 30605104004.
It is not a weakly prime, because it can be changed into another prime (30605104021) 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, 15302552013 + 15302552014.
It is an arithmetic number, because the mean of its divisors is an integer number (15302552014).
Almost surely, 230605104027 is an apocalyptic number.
30605104027 is a deficient number, since it is larger than the sum of its proper divisors (1).
30605104027 is an equidigital number, since it uses as much as digits as its factorization.
30605104027 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 30605104027 in words is "thirty billion, six hundred five million, one hundred four thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •