Search a number
-
+
306614116656137 is a prime number
BaseRepresentation
bin100010110110111010010100…
…1100000011010010000001001
31111012122000121222022121221202
41011231310221200122100021
5310142031202330444022
63004040325230313545
7121404065433441203
oct10555645140322011
91435560558277852
10306614116656137
1189773353491134
122a47ba533588b5
1310211782c26b84
1455a02b966b773
15256ab0bb3c592
hex116dd2981a409

306614116656137 has 2 divisors, whose sum is σ = 306614116656138. Its totient is φ = 306614116656136.

The previous prime is 306614116656053. The next prime is 306614116656139. The reversal of 306614116656137 is 731656611416603.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 294338595377401 + 12275521278736 = 17156299^2 + 3503644^2 .

It is a cyclic number.

It is not a de Polignac number, because 306614116656137 - 230 = 306613042914313 is a prime.

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

It is a Chen prime.

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

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

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

Almost surely, 2306614116656137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9797760, while the sum is 56.

The spelling of 306614116656137 in words is "three hundred six trillion, six hundred fourteen billion, one hundred sixteen million, six hundred fifty-six thousand, one hundred thirty-seven".