Search a number
-
+
101322130109609 is a prime number
BaseRepresentation
bin10111000010011011100101…
…100100101011010010101001
3111021202022010110101000211002
4113002123211210223102221
5101240030210302001414
6555254424411244345
730225165560510633
oct2702334544532251
9437668113330732
10101322130109609
112a314523a91252
12b444aa84496b5
13446c8360189a6
141b04035529a53
15baa94b4744de
hex5c26e592b4a9

101322130109609 has 2 divisors, whose sum is σ = 101322130109610. Its totient is φ = 101322130109608.

The previous prime is 101322130109593. The next prime is 101322130109611. The reversal of 101322130109609 is 906901031223101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67194661645225 + 34127468464384 = 8197235^2 + 5841872^2 .

It is a cyclic number.

It is not a de Polignac number, because 101322130109609 - 24 = 101322130109593 is a prime.

Together with 101322130109611, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 2101322130109609 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17496, while the sum is 38.

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