Search a number
-
+
102020674240301 is a prime number
BaseRepresentation
bin10111001100100110001010…
…000011000011111100101101
3111101020002012012101121022112
4113030212022003003330231
5101333001320101142201
61000551352320253405
730326515261610345
oct2714461203037455
9441202165347275
10102020674240301
112a5637a7a31773
12b538359471265
1344c067b9753ab
141b29b81337d25
15bbdbd27ed0bb
hex5cc98a0c3f2d

102020674240301 has 2 divisors, whose sum is σ = 102020674240302. Its totient is φ = 102020674240300.

The previous prime is 102020674240283. The next prime is 102020674240327. The reversal of 102020674240301 is 103042476020201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 101260970248201 + 759703992100 = 10062851^2 + 871610^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 102020674240301 - 246 = 31651930062637 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2102020674240301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16128, while the sum is 32.

The spelling of 102020674240301 in words is "one hundred two trillion, twenty billion, six hundred seventy-four million, two hundred forty thousand, three hundred one".