Search a number
-
+
10321539913 is a prime number
BaseRepresentation
bin10011001110011011…
…00011001101001001
3222122022210112222001
421213031203031021
5132114303234123
64424110231001
7513530433046
oct114715431511
928568715861
1010321539913
114417270783
1220007b5461
13c864ba589
146dcb421cd
154062240ad
hex267363349

10321539913 has 2 divisors, whose sum is σ = 10321539914. Its totient is φ = 10321539912.

The previous prime is 10321539847. The next prime is 10321539967. The reversal of 10321539913 is 31993512301.

10321539913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8294109184 + 2027430729 = 91072^2 + 45027^2 .

It is a cyclic number.

It is not a de Polignac number, because 10321539913 - 213 = 10321531721 is a prime.

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

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

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

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

Almost surely, 210321539913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21870, while the sum is 37.

The spelling of 10321539913 in words is "ten billion, three hundred twenty-one million, five hundred thirty-nine thousand, nine hundred thirteen".