Search a number
-
+
266510245336031 is a prime number
BaseRepresentation
bin111100100110001111000000…
…100000001001001111011111
31021221122010112020011211120102
4330212033000200021033133
5234413000440301223111
62342453041055211315
7110064505216624334
oct7446170040111737
91257563466154512
10266510245336031
1177a113a6647964
1225a83579b16b3b
13b592a67aa3c28
1449b5243d1698b
1520c2822dcd13b
hexf263c08093df

266510245336031 has 2 divisors, whose sum is σ = 266510245336032. Its totient is φ = 266510245336030.

The previous prime is 266510245335989. The next prime is 266510245336033. The reversal of 266510245336031 is 130633542015662.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-266510245336031 is a prime.

It is a super-2 number, since 2×2665102453360312 (a number of 30 digits) contains 22 as substring.

It is a Sophie Germain prime.

Together with 266510245336033, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (266510245336033) by changing a digit.

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

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

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

Almost surely, 2266510245336031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2332800, while the sum is 47.

The spelling of 266510245336031 in words is "two hundred sixty-six trillion, five hundred ten billion, two hundred forty-five million, three hundred thirty-six thousand, thirty-one".