Search a number
-
+
26275500391529 is a prime number
BaseRepresentation
bin1011111100101101111011…
…10111011111110001101001
310110000220122210121000121202
411332112331313133301221
511420444211100012104
6131514444230413545
75351225252151464
oct576267567376151
9113026583530552
1026275500391529
118410416a74284
122b4444bb012b5
1311879cc7ca28c
1466ba534602db
153087456ee51e
hex17e5bdddfc69

26275500391529 has 2 divisors, whose sum is σ = 26275500391530. Its totient is φ = 26275500391528.

The previous prime is 26275500391429. The next prime is 26275500391573. The reversal of 26275500391529 is 92519300557262.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 24636977509225 + 1638522882304 = 4963565^2 + 1280048^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-26275500391529 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 (26275500391429) by changing a digit.

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

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

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

Almost surely, 226275500391529 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10206000, while the sum is 56.

The spelling of 26275500391529 in words is "twenty-six trillion, two hundred seventy-five billion, five hundred million, three hundred ninety-one thousand, five hundred twenty-nine".