Search a number
-
+
101323003013 is a prime number
BaseRepresentation
bin101111001011101010…
…0100101010010000101
3100200112101002212012022
41132113110211102011
53130002142044023
6114314103332525
710214610213101
oct1362724452205
9320471085168
10101323003013
1139a75214921
1217778a51145
13972993c96b
144c92a4c901
1529804707c8
hex1797525485

101323003013 has 2 divisors, whose sum is σ = 101323003014. Its totient is φ = 101323003012.

The previous prime is 101323003007. The next prime is 101323003031. The reversal of 101323003013 is 310300323101.

Together with next prime (101323003031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 95865782884 + 5457220129 = 309622^2 + 73873^2 .

It is a cyclic number.

It is not a de Polignac number, because 101323003013 - 24 = 101323002997 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 101323002982 and 101323003000.

It is a congruent number.

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

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

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

Almost surely, 2101323003013 is an apocalyptic number.

It is an amenable number.

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

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

101323003013 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 162, while the sum is 17.

Adding to 101323003013 its reverse (310300323101), we get a palindrome (411623326114).

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