Search a number
-
+
102221292731513 is a prime number
BaseRepresentation
bin10111001111100000111111…
…110101110111110001111001
3111101221021000122110220020212
4113033200333311313301321
5101344243201414402023
61001223451423000505
730350146632626624
oct2717407765676171
9441837018426225
10102221292731513
112a63089693052a
12b56b208139135
1345065711658a7
141b35773616dbb
15bc40251e3e78
hex5cf83fd77c79

102221292731513 has 2 divisors, whose sum is σ = 102221292731514. Its totient is φ = 102221292731512.

The previous prime is 102221292731477. The next prime is 102221292731533. The reversal of 102221292731513 is 315137292122201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 65362648970089 + 36858643761424 = 8084717^2 + 6071132^2 .

It is a cyclic number.

It is not a de Polignac number, because 102221292731513 - 224 = 102221275954297 is a prime.

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

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

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

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

Almost surely, 2102221292731513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 90720, while the sum is 41.

The spelling of 102221292731513 in words is "one hundred two trillion, two hundred twenty-one billion, two hundred ninety-two million, seven hundred thirty-one thousand, five hundred thirteen".