Search a number
-
+
10390373153357 is a prime number
BaseRepresentation
bin1001011100110011001010…
…0000000011101001001101
31100210022100222012010212112
42113030302200003221031
52330213441011401412
634033134352313405
72121452063402111
oct227146240035115
940708328163775
1010390373153357
11334659485000a
1211b9882b42865
135a4a671ab0b2
1427cc7a945741
151304265dc722
hex97332803a4d

10390373153357 has 2 divisors, whose sum is σ = 10390373153358. Its totient is φ = 10390373153356.

The previous prime is 10390373153297. The next prime is 10390373153389. The reversal of 10390373153357 is 75335137309301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6360983365801 + 4029389787556 = 2522099^2 + 2007334^2 .

It is a cyclic number.

It is not a de Polignac number, because 10390373153357 - 222 = 10390368959053 is a prime.

It is a congruent number.

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

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

Almost surely, 210390373153357 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2679075, while the sum is 50.

The spelling of 10390373153357 in words is "ten trillion, three hundred ninety billion, three hundred seventy-three million, one hundred fifty-three thousand, three hundred fifty-seven".