Search a number
-
+
10384628416709 is a prime number
BaseRepresentation
bin1001011100011101110000…
…0101101000000011000101
31100202202112121110021200112
42113013130011220003011
52330120204333313314
634030344334522405
72121156526056551
oct227073405500305
940682477407615
1010384628416709
113344107018378
1211b873b066405
135a435cc78641
1427c8939c2861
151301dc0c843e
hex971dc1680c5

10384628416709 has 2 divisors, whose sum is σ = 10384628416710. Its totient is φ = 10384628416708.

The previous prime is 10384628416703. The next prime is 10384628416753. The reversal of 10384628416709 is 90761482648301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10125728589025 + 258899827684 = 3182095^2 + 508822^2 .

It is a cyclic number.

It is not a de Polignac number, because 10384628416709 - 28 = 10384628416453 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 210384628416709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13934592, while the sum is 59.

The spelling of 10384628416709 in words is "ten trillion, three hundred eighty-four billion, six hundred twenty-eight million, four hundred sixteen thousand, seven hundred nine".