Search a number
-
+
306211100050469 is a prime number
BaseRepresentation
bin100010110011111110101001…
…1110110000100010000100101
31111011012111101001110210221002
41011213331103312010100211
5310113430313103103334
63003131234250003045
7121333010342013365
oct10547752366042045
91434174331423832
10306211100050469
11896284420872a9
122a415919a16485
13101b277663bb83
1455889a69bc9a5
1525603c04beb7e
hex1167f53d84425

306211100050469 has 2 divisors, whose sum is σ = 306211100050470. Its totient is φ = 306211100050468.

The previous prime is 306211100050423. The next prime is 306211100050601. The reversal of 306211100050469 is 964050001112603.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 271572437097025 + 34638662953444 = 16479455^2 + 5885462^2 .

It is a cyclic number.

It is not a de Polignac number, because 306211100050469 - 28 = 306211100050213 is a prime.

It is a super-2 number, since 2×3062111000504692 (a number of 30 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (306211100050409) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 153105550025234 + 153105550025235.

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

Almost surely, 2306211100050469 is an apocalyptic number.

It is an amenable number.

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

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

306211100050469 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 38880, while the sum is 38.

The spelling of 306211100050469 in words is "three hundred six trillion, two hundred eleven billion, one hundred million, fifty thousand, four hundred sixty-nine".