Search a number
-
+
102001331013013 is a prime number
BaseRepresentation
bin10111001100010100001001…
…000110100000010110010101
3111101011020021010200211212001
4113030110021012200112111
5101332142211214404023
61000534433051555301
730325232033105605
oct2714241106402625
9441136233624761
10102001331013013
112a556581207813
12b53465b45bb31
1344bb8b8383383
141b28c68376c05
15bbd44e5666ad
hex5cc5091a0595

102001331013013 has 2 divisors, whose sum is σ = 102001331013014. Its totient is φ = 102001331013012.

The previous prime is 102001331012953. The next prime is 102001331013041. The reversal of 102001331013013 is 310310133100201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 96461135460369 + 5540195552644 = 9821463^2 + 2353762^2 .

It is a cyclic number.

It is not a de Polignac number, because 102001331013013 - 245 = 66816958924181 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2102001331013013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162, while the sum is 19.

Adding to 102001331013013 its reverse (310310133100201), we get a palindrome (412311464113214).

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