Search a number
-
+
306085610141 is a prime number
BaseRepresentation
bin1000111010001000001…
…11111100001010011101
31002021001122002001110022
410131010013330022131
520003330404011031
6352340324521525
731054041521063
oct4350407741235
91067048061408
10306085610141
111088a0390273
124b3a35502a5
1322b2c87045c
1410b59478033
157e66aa797b
hex47441fc29d

306085610141 has 2 divisors, whose sum is σ = 306085610142. Its totient is φ = 306085610140.

The previous prime is 306085610137. The next prime is 306085610143. The reversal of 306085610141 is 141016580603.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 228938325625 + 77147284516 = 478475^2 + 277754^2 .

It is a cyclic number.

It is not a de Polignac number, because 306085610141 - 22 = 306085610137 is a prime.

Together with 306085610143, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (306085610143) 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, 153042805070 + 153042805071.

It is an arithmetic number, because the mean of its divisors is an integer number (153042805071).

Almost surely, 2306085610141 is an apocalyptic number.

It is an amenable number.

306085610141 is a deficient number, since it is larger than the sum of its proper divisors (1).

306085610141 is an equidigital number, since it uses as much as digits as its factorization.

306085610141 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 17280, while the sum is 35.

The spelling of 306085610141 in words is "three hundred six billion, eighty-five million, six hundred ten thousand, one hundred forty-one".