Search a number
-
+
10393110323 is a prime number
BaseRepresentation
bin10011010110111101…
…00100011100110011
3222211022110201002222
421223132210130303
5132241114012243
64435144231255
7515356660121
oct115336443463
928738421088
1010393110323
114453704682
12202076b52b
13c98288b2b
14708452911
1540c660168
hex26b7a4733

10393110323 has 2 divisors, whose sum is σ = 10393110324. Its totient is φ = 10393110322.

The previous prime is 10393110253. The next prime is 10393110331. The reversal of 10393110323 is 32301139301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10393110323 - 210 = 10393109299 is a prime.

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

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

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

Almost surely, 210393110323 is an apocalyptic number.

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

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

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

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

Adding to 10393110323 its reverse (32301139301), we get a palindrome (42694249624).

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