Search a number
-
+
101321031132313 is a prime number
BaseRepresentation
bin10111000010011010100100…
…000100011010010010011001
3111021202012021212110012101021
4113002122210010122102121
5101240020432432213223
6555254123352322441
730225126414404326
oct2702324404322231
9437665255405337
10101321031132313
112a31400a705353
12b4448403a3421
13446c6bc435675
141b03d6d5b5b4d
15baa8d4c4165d
hex5c26a411a499

101321031132313 has 2 divisors, whose sum is σ = 101321031132314. Its totient is φ = 101321031132312.

The previous prime is 101321031132221. The next prime is 101321031132359. The reversal of 101321031132313 is 313231130123101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100521317665024 + 799713467289 = 10026032^2 + 894267^2 .

It is a cyclic number.

It is not a de Polignac number, because 101321031132313 - 213 = 101321031124121 is a prime.

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

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

Almost surely, 2101321031132313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101321031132313 its reverse (313231130123101), we get a palindrome (414552161255414).

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