Search a number
-
+
101321022149 is a prime number
BaseRepresentation
bin101111001011100110…
…1000001101011000101
3100200112020101012221222
41132113031001223011
53130001140202044
6114313553050125
710214554323014
oct1362715015305
9320466335858
10101321022149
1139a74091646
1217778256945
1397293c8159
144c92694a7b
1529801cd8ee
hex1797341ac5

101321022149 has 2 divisors, whose sum is σ = 101321022150. Its totient is φ = 101321022148.

The previous prime is 101321022133. The next prime is 101321022151. The reversal of 101321022149 is 941220123101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 77545540900 + 23775481249 = 278470^2 + 154193^2 .

It is a cyclic number.

It is not a de Polignac number, because 101321022149 - 24 = 101321022133 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2101321022149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 864, while the sum is 26.

The spelling of 101321022149 in words is "one hundred one billion, three hundred twenty-one million, twenty-two thousand, one hundred forty-nine".