Search a number
-
+
131321020121113 is a prime number
BaseRepresentation
bin11101110110111110001110…
…110000011000000000011001
3122012222011111200102112100011
4131312332032300120000121
5114203030422122333423
61143144013243441521
736442426204363114
oct3566761660300031
9565864450375304
10131321020121113
113892aa28365539
121288aa87b262a1
1358376994ba9c4
14245dd852d757b
15102ae63a92b0d
hex776f8ec18019

131321020121113 has 2 divisors, whose sum is σ = 131321020121114. Its totient is φ = 131321020121112.

The previous prime is 131321020121077. The next prime is 131321020121171. The reversal of 131321020121113 is 311121020123131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 130408246247449 + 912773873664 = 11419643^2 + 955392^2 .

It is a cyclic number.

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

It is not a weakly prime, because it can be changed into another prime (131321020121713) 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, 65660510060556 + 65660510060557.

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

Almost surely, 2131321020121113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 131321020121113 its reverse (311121020123131), we get a palindrome (442442040244244).

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