Search a number
-
+
302101310010397 is a prime number
BaseRepresentation
bin100010010110000100111000…
…1010001001111010000011101
31110121122121021201110012111111
41010230021301101033100131
5304044111440330313042
62550303231554222021
7120430046042036002
oct10454116121172035
91417577251405444
10302101310010397
118829349a810627
1229a71311584911
13cc750539aa0b1
145485ad23118a9
1524dd535a92517
hex112c27144f41d

302101310010397 has 2 divisors, whose sum is σ = 302101310010398. Its totient is φ = 302101310010396.

The previous prime is 302101310010391. The next prime is 302101310010469. The reversal of 302101310010397 is 793010013101203.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 240084519504921 + 62016790505476 = 15494661^2 + 7875074^2 .

It is an emirp because it is prime and its reverse (793010013101203) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-302101310010397 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2302101310010397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3402, while the sum is 31.

The spelling of 302101310010397 in words is "three hundred two trillion, one hundred one billion, three hundred ten million, ten thousand, three hundred ninety-seven".