Base | Representation |
---|---|
bin | 1101110010001001000000… |
… | …00000111011011101011001 |
3 | 10222022121201110200020022012 |
4 | 12321010200000323131121 |
5 | 12433100112024303304 |
6 | 144244135535235305 |
7 | 6245556030213122 |
oct | 671044000733531 |
9 | 128277643606265 |
10 | 30310121322329 |
11 | 97264a5337652 |
12 | 349637a378b35 |
13 | 13bb303126084 |
14 | 76b0367d3049 |
15 | 378680d0d16e |
hex | 1b912003b759 |
30310121322329 has 2 divisors, whose sum is σ = 30310121322330. Its totient is φ = 30310121322328.
The previous prime is 30310121322319. The next prime is 30310121322331. The reversal of 30310121322329 is 92322312101303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29980300832329 + 329820490000 = 5475427^2 + 574300^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30310121322329 is a prime.
Together with 30310121322331, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 30310121322295 and 30310121322304.
It is not a weakly prime, because it can be changed into another prime (30310121322319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15155060661164 + 15155060661165.
It is an arithmetic number, because the mean of its divisors is an integer number (15155060661165).
Almost surely, 230310121322329 is an apocalyptic number.
It is an amenable number.
30310121322329 is a deficient number, since it is larger than the sum of its proper divisors (1).
30310121322329 is an equidigital number, since it uses as much as digits as its factorization.
30310121322329 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 30310121322329 in words is "thirty trillion, three hundred ten billion, one hundred twenty-one million, three hundred twenty-two thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •