Search a number
-
+
250648516861 is a prime number
BaseRepresentation
bin1110100101101111010…
…0001101100011111101
3212221222010101221000021
43221123310031203331
513101312010014421
6311051335332141
724052206145321
oct3513364154375
9787863357007
10250648516861
119733260a5a6
12406b1821051
131a836543a92
14c1ba9c7981
1567bec1c341
hex3a5bd0d8fd

250648516861 has 2 divisors, whose sum is σ = 250648516862. Its totient is φ = 250648516860.

The previous prime is 250648516799. The next prime is 250648516879. The reversal of 250648516861 is 168615846052.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 163147327225 + 87501189636 = 403915^2 + 295806^2 .

It is a cyclic number.

It is not a de Polignac number, because 250648516861 - 211 = 250648514813 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2250648516861 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2764800, while the sum is 52.

The spelling of 250648516861 in words is "two hundred fifty billion, six hundred forty-eight million, five hundred sixteen thousand, eight hundred sixty-one".