Search a number
-
+
102000320331313 is a prime number
BaseRepresentation
bin10111001100010011001100…
…110111000011111000110001
3111101011010122200220220012111
4113030103030313003320301
5101332133124001100223
61000534144505325321
730325165011335665
oct2714231467037061
9441133580826174
10102000320331313
112a556102758688
12b534418a96841
1344bb786b76271
141b28bb00488a5
15bbd3e097530d
hex5cc4ccdc3e31

102000320331313 has 2 divisors, whose sum is σ = 102000320331314. Its totient is φ = 102000320331312.

The previous prime is 102000320331251. The next prime is 102000320331331. The reversal of 102000320331313 is 313133023000201.

Together with next prime (102000320331331) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 78870597951744 + 23129722379569 = 8880912^2 + 4809337^2 .

It is a cyclic number.

It is not a de Polignac number, because 102000320331313 - 237 = 101862881377841 is a prime.

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

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

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

Almost surely, 2102000320331313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 22.

Adding to 102000320331313 its reverse (313133023000201), we get a palindrome (415133343331514).

The spelling of 102000320331313 in words is "one hundred two trillion, three hundred twenty million, three hundred thirty-one thousand, three hundred thirteen".