Search a number
-
+
10326793121 is a prime number
BaseRepresentation
bin10011001111000011…
…00101101110100001
3222122200200110000022
421213201211232201
5132122124334441
64424415003225
7513623202401
oct114741455641
928580613008
1010326793121
11441a229577
122002509515
13c87609698
146dd70c801
1540691084b
hex267865ba1

10326793121 has 2 divisors, whose sum is σ = 10326793122. Its totient is φ = 10326793120.

The previous prime is 10326793091. The next prime is 10326793133. The reversal of 10326793121 is 12139762301.

10326793121 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., 5556957025 + 4769836096 = 74545^2 + 69064^2 .

It is a cyclic number.

It is not a de Polignac number, because 10326793121 - 210 = 10326792097 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 210326793121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13608, while the sum is 35.

The spelling of 10326793121 in words is "ten billion, three hundred twenty-six million, seven hundred ninety-three thousand, one hundred twenty-one".